The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs

DOI10.1080/002075400188771MaRDI QIDQ4497273zbMATH OpenOpenAlexFDO

Authors Patrick R. Philipoom

Publication date 22 August 2000

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/002075400188771

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Using dispatching rules for job shop scheduling with due date-based objectives
• Job shop leadtime requirements under conditions of controlled delivery performance
• Setting Job-Shop Due-Dates with Service-Level Constraints
• An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
• Integration of priority dispatching and due-date assignment in a job shop

Cited in

(5)

• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
• Dynamic job shop scheduling for missed due date performance
• Heuristic dispatching rule to maximize TDD and IDD performance
• A time scheduling model of logistics service supply chain with mass customized logistics service
• New approaches to due date assignment in job shops

This page was built for publication: The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs

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