Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

2020 ◽  
Vol 164 ◽  
pp. 106009
Author(s):  
Baruch Mor ◽  
Gur Mosheiov ◽  
Dana Shapira
Keyword(s):  
Single Machine ◽  
Lot Scheduling ◽  
Weighted Number

scholarly journals A Batching Machine Model for Lot Scheduling on a Single Machine

2018 ◽  
Vol 43 (1) ◽  
pp. 37-40
Author(s):  
Mikhail Y. Kovalyov
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Optimal Solution ◽  
Time Algorithm ◽  
Machine Model ◽  
Average Completion Time ◽  
Lot Scheduling ◽  
Batching Machine ◽  
Machine Problem ◽  
Total Average

Abstract A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O(n log n) time algorithm is presented for this problem in the literature, with a relatively sophisticated proof of its optimality. We show that modeling this problem as a classic batching machine problem makes its optimal solution obvious.

Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Weighted Number ◽  
Tardy Jobs

We studied single machine scheduling problems in which the jobs need to be delivered to customers after processing. It is assumed that the delivery times are proportional to the length of the already processed jobs, and a job's processing time depended on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs and the cost of due date assignment. We analyzed these problems with two different due date assignment methods and conclude that the problems are polynomial time solvable.

Lot scheduling on a single machine

2014 ◽  
Vol 114 (12) ◽  
pp. 718-722 ◽  
Author(s):  
Yung-Tsung Hou ◽  
Dar-Li Yang ◽  
Wen-Hung Kuo
Keyword(s):  
Single Machine ◽  
Lot Scheduling
Sign in / Sign up

Export Citation Format

Share Document