Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds

DOI10.1016/0166-218X(93)E0153-PMaRDI QIDQ1804883zbMATH OpenOpenAlexFDO

Authors V. A. Strusevich

Publication date 17 May 1995

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

Full work available at URL https://doi.org/10.1016/0166-218x(93)e0153-p

zbMATH Keywords

two machine flow shop scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Two machine mixed shop scheduling problem with controllable machine speeds
• scientific article; zbMATH DE number 4010197
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• A controlable two-machine flowshop scheduling problem
• An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds

Cites work

• scientific article; zbMATH DE number 4027206 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3254602 (Why is no real title available?)
• A note on the flow-shop problem without interruptions in job processing
• An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
• Complexity of Scheduling Shops with No Wait in Process
• Flowshop scheduling with limited temporary storage
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• On the derivation of the Pauli and van Hove master equations.
• Optimal flowshop schedules with no intermediate storage space
• Recognition of Gilmore-Gomory traveling salesman problem
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Two machine mixed shop scheduling problem with controllable machine speeds

Cited in

(8)

• A survey of scheduling problems with no-wait in process
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
• A review of TSP based approaches for flowshop scheduling
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Single machine scheduling with controllable release and processing parameters
• Mean flow time minimization with given bounds of processing times
• Optimal makespan scheduling with given bounds of processing times
• Two machine mixed shop scheduling problem with controllable machine speeds

This page was built for publication: Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds

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