Production scheduling with applications in the printing industry

DOI10.1016/0377-2217(85)90249-8zbMath0572.90047OpenAlexW1995809045MaRDI QIDQ1062606

B. George

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90249-8

zbMATH Keywords

heuristicsproduction schedulingdue date scheduling algorithmprinting industry

Mathematics Subject Classification ID

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

Cites Work

• Extreme solutions of the two machine flow-shop problem
• Analysis of a Combinatorial Approach to Flowshop Scheduling Problems
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Optimal flowshop schedules with no intermediate storage space
• An Evaluation of Flow Shop Sequencing Heuristics
• Special cases of the flow-shop problem
• Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem

This page was built for publication: Production scheduling with applications in the printing industry