Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems

DOI10.1016/0377-2217(95)00347-9zbMath0917.90203OpenAlexW2160959723MaRDI QIDQ1278545

Chengbin Chu, Chengen Wang, Jean Marie Proth

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00347-9

zbMATH Keywords

flow shop schedulingsum of job completion timesjob queue timesmachine idle times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan ⋮ Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines ⋮ 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 ⋮ Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ 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 ⋮ Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• Openshop and flowshop scheduling to minimize sum of completion times
• Ordered Flow Shop Problems with no In-Process Waiting: Further Results
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times