Using tabu search to solve the common due date early/tardy machine scheduling problem
From MaRDI portal
Publication:1373879
DOI10.1016/S0305-0548(96)00052-4zbMath0889.90090OpenAlexW2062701203MaRDI QIDQ1373879
Publication date: 22 June 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00052-4
Related Items
Minimizing earliness and tardiness penalties in a single-machine problem with a common due date ⋮ A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date ⋮ A heuristic approach to bicriteria scheduling ⋮ A differential evolution approach for the common due date early/tardy job scheduling problem ⋮ Multiple machine JIT scheduling: a tabu search approach ⋮ Reducing tardy jobs by integrating process planning and scheduling functions ⋮ Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
Uses Software
Cites Work
- Unnamed Item
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- Future paths for integer programming and links to artificial intelligence
- Common due-date determination and sequencing using tabu search
- A tabu search experience in production scheduling
- Sequencing with Earliness and Tardiness Penalties: A Review
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Tabu Search—Part I
- An experimental comparison of solution algorithms for the single-machine tardiness problem
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
