Solvable Cases of the No-wait Flow-shop Scheduling Problem
From MaRDI portal
Publication:3984309
DOI10.1038/sj/jors/0421105zbMath0744.90044OpenAlexW4243078096MaRDI QIDQ3984309
Jack A. A. van der Veen, René van Dal
Publication date: 27 June 1992
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1038/sj/jors/0421105
travelling salesmanno-wait flow-shop schedulingmakespan objective functionmean objective functionpolynomial solvable casessemi-ordered processing times
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Complexity of flow shop scheduling problems with transportation constraints ⋮ 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. ⋮ Fitness landscape analysis for the no-wait flow-shop scheduling problem ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ Flowshop/no-idle scheduling to minimise the mean flowtime ⋮ Minimizing total completion time in two-machine flow shops with exact delays ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Stochastically minimizing total flowtime in flowshops with no waiting space ⋮ Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays ⋮ A review of TSP based approaches for flowshop scheduling
