Heuristic dispatching rule to maximize TDD and IDD performance
From MaRDI portal
Publication:4671362
DOI10.1080/0020754042000270421zbMath1060.90562WikidataQ56945902 ScholiaQ56945902MaRDI QIDQ4671362
Publication date: 26 April 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020754042000270421
90B30: Production models
Cites Work
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- Integrating order release control with due-date assignment rules
- Mixing macro and micro flowtime estimation model: Wafer fab example
- The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs