Heuristic dispatching rule to maximize TDD and IDD performance

DOI10.1080/0020754042000270421MaRDI QIDQ4671362zbMATH OpenOpenAlexWikidataFDO

Authors T.-F. Ho, Rong-Kwei Li

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

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• New dispatching rules for shop scheduling: A step forward
• Dispatching rules for scheduling in assembly jobshops - Part 2
• A comparison of job shop dispatching rules using a total cost criterion
• An evaluation of value based dispatching rules in a flow shop
• A comparative study of dispatching rules in dynamic flowshops and jobshops

Cites work

• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• 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
• 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

This page was built for publication: Heuristic dispatching rule to maximize TDD and IDD performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4671362)