An efficient heuristic approach to the scheduling of jobs in a flowshop
From MaRDI portal
Publication:1194720
DOI10.1016/0377-2217(92)90361-CzbMath0757.90036MaRDI QIDQ1194720
Dipak Chaudhuri, Chandrasekharan Rajendran
Publication date: 6 October 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A discrete inter-species cuckoo search for flowshop scheduling problems, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling, A discrete version of particle swarm optimization for flowshop scheduling problems, Flowshop sequencing with mean flowtime objective, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Total flowtime in no-wait flowshops with separated setup times., Minimizing makespan on an \(m\)-machine re-entrant flowshop, A bicriteria flowshop scheduling with a learning effect, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Comparison of heuristics for flowtime minimisation in permutation flowshops, A flexible flowshop problem with total flow time minimization, Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, Heuristics for scheduling in a flow shop with multiple processors, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, A bicriteria two-machine permutation flowshop problem, Some results of the worst-case analysis for flow shop scheduling, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
Cites Work
- A new heuristic for the n-job, M-machine flow-shop problem
- Optimal two- and three-stage production schedules with setup times included
- An Evaluation of Flow Shop Sequencing Heuristics
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Errata
- Unnamed Item
- Unnamed Item
