Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights
Authors:
- 1 April 1995
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 28 (2) , 231-243
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due DateOperations Research, 1991
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due dateComputers & Operations Research, 1991
- Scheduling to minimize weighted earliness and tardiness about a common due-dateComputers & Operations Research, 1991
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- Single-machine scheduling to minimize absolute deviation of completion times from a common due dateNaval Research Logistics (NRL), 1989
- New approaches for heuristic search: A bilateral linkage with artificial intelligenceEuropean Journal of Operational Research, 1989
- Survey of scheduling research involving due date determination decisionsEuropean Journal of Operational Research, 1989
- Minimizing mean absolute deviation of completion times about a common due dateNaval Research Logistics Quarterly, 1986
- Minimizing the sum of absolute lateness in single‐machine and multimachine schedulingNaval Research Logistics Quarterly, 1984