Deterministic job-shop scheduling problems with capacity focus

DOI10.1007/BF02243825zbMath0784.90037OpenAlexW339384852MaRDI QIDQ1308500

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

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

Cites Work

• A new heuristic method for the flow shop sequencing problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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