Deterministic job-shop scheduling problems with capacity focus

DOI10.1007/BF02243825MaRDI QIDQ1308500zbMATH OpenOpenAlexFDO

Authors W. K. Heuser

Publication date 4 January 1994

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02243825

zbMATH Keywords

capacityjob-shop schedulingoptimal production sequenceproduction graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4099024
• Deterministic job-shop scheduling: Past, present and future
• scientific article; zbMATH DE number 782644
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• scientific article; zbMATH DE number 1640601

Cites work

• A new heuristic method for the flow shop sequencing problem
• scientific article; zbMATH DE number 49483 (Why is no real title available?)
• scientific article; zbMATH DE number 3609459 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 3304553 (Why is no real title available?)

Cited in

(1)

• Finite capacity scheduling—packed placement sequence schedule

This page was built for publication: Deterministic job-shop scheduling problems with capacity focus

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