Job shop scheduling with unit time operations under resource constraints and release dates

DOI10.1016/0166-218X(87)90023-0zbMath0636.90046MaRDI QIDQ1098767

Jayme Luiz Szwarcfiter

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

job shop schedulingpolynomial timeminimum lengthsum of completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Flexible flow shop with dedicated buffers

Cites Work

• Scheduling subject to resource constraints: Classification and complexity
• Some new results in flow shop scheduling
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• Computational Complexity of Discrete Optimization Problems

This page was built for publication: Job shop scheduling with unit time operations under resource constraints and release dates