A controlable two-machine flowshop scheduling problem

MaRDI QIDQ2916936zbMATH OpenFDO

Authors Zhenwei Wen

Publication date 5 October 2012

Published in Mathematics in Practice and Theory (Search for Journal in Brave)

zbMATH Keywords

production managementJohnson's ruletwo-machine flow-shop scheduling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4010197
• A two-machine flow shop scheduling problem with controllable job processing times
• scientific article; zbMATH DE number 4074798
• Two parallel machine sequencing problems involving controllable job processing times
• A survey of scheduling with controllable processing times

Cited in

(9)

• A robust two-machine flow-shop scheduling model with scenario-dependent processing times
• Two-machine flowshop scheduling with flexible operations and controllable processing times
• scientific article; zbMATH DE number 4010197 (Why is no real title available?)
• scientific article; zbMATH DE number 1547866 (Why is no real title available?)
• A two-machine flow shop scheduling problem with controllable job processing times
• A subgradient descent algorithm for optimization of initially controllable flow shop systems
• A search method for optimal control of a flow shop system of traditional machines
• Two machine mixed shop scheduling problem with controllable machine speeds
• Two-machine open shop problem with controllable processing times

This page was built for publication: A controlable two-machine flowshop scheduling problem

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