A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

2002 ◽  
Vol 30 (1) ◽  
pp. 66-68 ◽  
Author(s):  
C.T Ng ◽  
T.C.E Cheng ◽  
J.J Yuan
Keyword(s):  
Single Machine ◽  
Precedence Constraints ◽  
Maximum Lateness ◽  
Scheduling Problem

scholarly journals Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

2015 ◽  
Vol 2015 ◽  
pp. 1-5 ◽  
Author(s):  
Ting Wang ◽  
Dehua Xu
Keyword(s):  
Single Machine ◽  
Time Window ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maximum Lateness ◽  
Scheduling Problem ◽  
Due Date ◽  
Start Time ◽  
Tight Bound ◽  
Special Cases

A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.

Sign in / Sign up

Export Citation Format

Share Document