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
Date : 1394-10
Article type
Journal