Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem

DOI10.1016/S0377-2217(00)00137-5zbMath1134.90389MaRDI QIDQ5946533

Jiyin Liu, Colin R. Reeves

Publication date: 11 March 2002

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

zbMATH Keywords

Heuristics; Scheduling; Flowshop

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Scheduling in flowshops to minimize total tardiness of jobs, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A discrete version of particle swarm optimization for flowshop scheduling problems, A note on the total completion time problem in a permutation flowshop with a learning effect, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, A genetic algorithm for flowshop scheduling with multiple objectives, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs., Local search methods for the flowshop scheduling problem with flowtime minimization, Comparison of heuristics for flowtime minimisation in permutation flowshops, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

Cites Work

• Unnamed Item
• Flowshop sequencing with mean flowtime objective
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• Landscapes, operators and heuristic search
• Some results of the worst-case analysis for flow shop scheduling
• A new adaptive multi-start technique for combinatorial global optimizations
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• A new heuristic for the n-job, M-machine flow-shop problem
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
• AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey