Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
From MaRDI portal
Publication:2480060
DOI10.1016/j.orl.2005.06.005zbMath1152.90468OpenAlexW2066251914MaRDI QIDQ2480060
Publication date: 28 March 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.06.005
Analysis of algorithms and problem complexity (68Q25) Search theory (90B40) Deterministic scheduling theory in operations research (90B35)
Related Items
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ Fast neighborhood search for the single machine earliness-tardiness scheduling problem ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A dynamic programming-based matheuristic for the dynamic berth allocation problem ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem ⋮ Scheduling with returnable containers ⋮ A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time ⋮ Exponential neighborhood search for a parallel machine scheduling problem ⋮ A survey of scheduling problems with setup times or costs ⋮ A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Cites Work
- A survey of very large-scale neighborhood search techniques
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
- Optimal timing of a sequence of tasks with general completion costs
- Earliness-tardiness scheduling with setup considerations
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
