Common due date assignment and scheduling with ready times
From MaRDI portal
Publication:1867095
DOI10.1016/S0305-0548(01)00067-3zbMath1010.90021OpenAlexW1963986787MaRDI QIDQ1867095
Cheng, T. C. Edwin, Natalia V. Shakhlevich, Zhi-Long Chen
Publication date: 2 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00067-3
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Single machine due-date scheduling of jobs with decreasing start-time dependent processing times ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
Cites Work
- Unnamed Item
- Minimizing average completion time in the presence of release dates
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Common due date assignment and scheduling with ready times
