Solvable Cases of the No-wait Flow-shop Scheduling Problem

DOI10.1038/SJ/JORS/0421105MaRDI QIDQ3984309zbMATH OpenOpenAlexFDO

Authors Jack A. A. van der Veen, René van Dal

Publication date 27 June 1992

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1038/sj/jors/0421105

zbMATH Keywords

makespan objective functionmean objective functionno-wait flow-shop schedulingpolynomial solvable casessemi-ordered processing timestravelling salesman

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On no-wait and no-idle flow shops with makespan criterion
• Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
• scientific article; zbMATH DE number 3843477

Cited in

(20)

• Minimizing total completion time in two-machine flow shops with exact delays
• Total flowtime in no-wait flowshops with separated setup times.
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• New heuristics for no-wait flowshops to minimize makespan.
• Stochastically minimizing total flowtime in flowshops with no waiting space
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
• Complexity of flow shop scheduling problems with transportation constraints
• Lot sizing in a no-wait flow shop
• Cyclic flow-shop scheduling with no-wait constraints and missing operations
• On Eulerian extensions and their application to no-wait flowshop scheduling
• A review of TSP based approaches for flowshop scheduling
• Flowshop/no-idle scheduling to minimise the mean flowtime
• COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
• Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
• Fitness landscape analysis for the no-wait flow-shop scheduling problem
• scientific article; zbMATH DE number 6747350 (Why is no real title available?)
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• scientific article; zbMATH DE number 4189461 (Why is no real title available?)
• Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates
• A new heuristic and dominance relations for no-wait flowshops with setups

This page was built for publication: Solvable Cases of the No-wait Flow-shop Scheduling Problem

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