A genetic algorithm for scheduling open shops with sequence-dependent setup times
From MaRDI portal
Publication:2333145
DOI10.1016/j.cor.2019.104793zbMath1458.90245OpenAlexW2971700084WikidataQ127322465 ScholiaQ127322465MaRDI QIDQ2333145
Bruno A. Prata, Levi R. Abreu, Jose M. Framinan, Jesus Ossian Cunha
Publication date: 11 November 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.104793
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
An exact solution method for multi-manned disassembly line design with and/or precedence relations ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem ⋮ Optimization for cooperative task planning of heterogeneous multi-robot systems in an order picking warehouse ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- A contribution and new heuristics for open shop scheduling
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Classical and new heuristics for the open-shop problem: A computational evaluation
- A branch \(\&\) bound algorithm for the open-shop problem
- New approximate algorithms for the customer order scheduling problem with total completion time objective
- Large-scale medical examination scheduling technology based on intelligent optimization
- A new lower bound for the open-shop problem
- Benchmarks for basic scheduling problems
- Two machine open shop scheduling problem with setup, processing and removal times separated
- A survey of scheduling problems with setup times or costs
- Open Shop Scheduling to Minimize Finish Time
- Manufacturing Scheduling Systems
- Handbook of metaheuristics
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: A genetic algorithm for scheduling open shops with sequence-dependent setup times
