Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
From MaRDI portal
Publication:5946533
DOI10.1016/S0377-2217(00)00137-5zbMath1134.90389MaRDI QIDQ5946533
Publication date: 11 March 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Trade-off balancing in scheduling for flow shop production and perioperative processes ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A new set of high-performing heuristics to minimise flowtime in permutation flowshops ⋮ Variability of completion time differences in permutation flow shop scheduling ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ 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 ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ 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 variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ A note on the total completion time problem in a permutation flowshop with a learning effect ⋮ An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Comparison of heuristics for flowtime minimisation in permutation flowshops ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ 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 new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ 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 ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ A genetic algorithm for scheduling open shops with sequence-dependent setup times ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
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
