A dynamic job shop scheduling framework: a backward approach

DOI10.1080/00207549408956982zbMath0902.90101OpenAlexW1963751161MaRDI QIDQ4394248

No author found.

Publication date: 11 June 1998

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

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

zbMATH Keywords

dynamic schedulingdue-date assignmentbackward schedulingjob release timesrolling time window approach

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (4)

Executing production schedules in the face of uncertainties: a review and some future directions ⋮ Adaptive scheduling and tool flow control in flexible job shops ⋮ Integrated Material Planning and Operations Scheduling (IMPOS) ⋮ Integration of the human operator into responsive discrete production management systems

Cites Work

• Unnamed Item
• Optimal due-date assignment in a job shop†
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Due Date Assignment for Production Systems
• Alternative Formulation of the Job Shop Problem with Due Dates
• Job-Shop Scheduling by Implicit Enumeration
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: A dynamic job shop scheduling framework: a backward approach