Single-machine batch delivery scheduling with an assignable common due date and controllable processing times
- 31 August 2013
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 65 (4), 652-662
- https://doi.org/10.1016/j.cie.2013.05.003
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery systemComputers & Industrial Engineering, 2012
- A survey of the state-of-the-art of common due date assignment and scheduling researchEuropean Journal of Operational Research, 2002
- Common due date assignment for scheduling on a single machine with jointly reducible processing timesInternational Journal of Production Economics, 2001
- SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND EARLINESS, TARDINESS AND COMPLETION TIME PENALTIESEngineering Optimization, 1999
- Solving a class of two-resource allocation problem by equivalent load methodJournal of the Operational Research Society, 1997
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costsEuropean Journal of Operational Research, 1996
- Due-date assignment and single machine scheduling with compressible processing timesInternational Journal of Production Economics, 1996
- Two parallel machine sequencing problems involving controllable job processing timesEuropean Journal of Operational Research, 1993
- A multi-objective approach to resource allocation in single machine schedulingEuropean Journal of Operational Research, 1990
- Survey of scheduling research involving due date determination decisionsEuropean Journal of Operational Research, 1989