Common due date assignment and scheduling with ready times

Authors:
T. C. E. Cheng;Z.-L. Chen;N. V. Shakhlevich
Affiliations:
Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Systems Engineering, University of Pennsylvania, Philadelphia, PA;Institute of Engineering Cybernetics, Surganov Street 6, 220012 Minsk, Belarus
Venue:
Computers and Operations Research
Year:
2002

Citing 1
Cited 4

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Operations Research Letters

Using genetic algorithms to solve quality-related bin packing problem

Robotics and Computer-Integrated Manufacturing
Job scheduling to minimize the weighted waiting time variance of jobs

Computers and Industrial Engineering
Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Computers and Industrial Engineering
Scheduling problems with two competing agents to minimized weighted earliness-tardiness

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of scheduling a set of nonsimultaneously available jobs on one machine. Each job has a ready time only at or after which the job can be processed. All the jobs have a common due date, which needs to be determined. The problem is to determine a due date and a schedule so as to minimize a total penalty depending on the earliness, tardiness and due date. We show that this problem is strongly NP-hard and give an efficient algorithm that finds an optimal due date and schedule when either the job sequence is predetermined or all jobs have the same processing time. We also propose three approximation algorithms for the general and special cases together with their experimental analysis.