The two-machine permutation flow shop with state-dependent processing times

DOI10.1002/1520-6750(199308)40:5%3C697::AID-NAV3220400511%3E3.0.CO;2-VMaRDI QIDQ4201454zbMATH OpenOpenAlexFDO

Authors Edouard Wagneur, Chelliah Sriskandarajah

Publication date 25 August 1993

Full work available at URL https://doi.org/10.1002/1520-6750(199308)40:5%3C697::aid-nav3220400511%3E3.0.co;2-v

zbMATH Keywords

flow shopminimum makespan scheduleNP-hardpermutation schedulestwo machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Two-machine flow shops with an optimal permutation schedule under a storage constraint
• A two-machine permutation flow shop scheduling problem with buffers
• The two-machine total completion time flow shop problem
• The two-machine sequence dependent flowshop scheduling problem
• On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
• A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
• Permutation schedules for a two-machine flow shop with storage
• Two-machine and two-agent flow shop with special processing times structures

Cited in

(20)

• The two-machine sequence dependent flowshop scheduling problem
• Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
• A variant of the permutation flow shop model with variable processing times
• A concise survey of scheduling with time-dependent processing times
• A permutation flow-shop scheduling problem with convex models of operation processing times
• Flow shop scheduling with flexible processing times
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations
• Permutation schedules for a two-machine flow shop with storage
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
• Two-machine flow shops with an optimal permutation schedule under a storage constraint
• A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• A review of TSP based approaches for flowshop scheduling
• Permutation flow shop problem with shortening job processing times
• Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• On non-permutation solutions to some two machine flow shop scheduling problems
• Permutation Schedules for Flow Shops with Precedence Constraints
• Synchronous flow shop scheduling with pliable jobs
• Total completion time in a two-machine flowshop with deteriorating tasks

This page was built for publication: The two-machine permutation flow shop with state-dependent processing times

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