Minimizing the Total Completion Time in a Single Machine Scheduling Problem under Bimodal Flexible Periodic Availability

Minimizing the Total Completion Time in a Single Machine Scheduling Problem under Bimodal Flexible Periodic Availability
-

doi
Article type
Journal
https://people.iut.ac.ir/en/moslehi/content/1618144