A genetic algorithm for scheduling open shops with sequence-dependent setup times
From MaRDI portal
Publication:2333145
DOI10.1016/J.COR.2019.104793zbMATH Open1458.90245OpenAlexW2971700084WikidataQ127322465 ScholiaQ127322465MaRDI QIDQ2333145FDOQ2333145
Authors: Levi R. Abreu, Bruno A. Prata, 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
Recommendations
- A hybrid genetic algorithm for the open shop scheduling problem
- Competitive genetic algorithms for the open-shop scheduling problem
- Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
- A Genetic Algorithm for the Batch Scheduling with Sequence-Dependent Setup Times
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- Scheduling in a sequence dependent setup environment with genetic search
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- A survey of scheduling problems with setup times or costs
- Open Shop Scheduling to Minimize Finish Time
- Handbook of metaheuristics
- Benchmarks for basic scheduling problems
- The third comprehensive survey on scheduling problems with setup times/costs
- A contribution and new heuristics for open shop scheduling
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Manufacturing Scheduling Systems
- Classical and new heuristics for the open-shop problem: A computational evaluation
- A branch \(\&\) bound algorithm for the open-shop problem
- A new lower bound for the open-shop problem
- New approximate algorithms for the customer order scheduling problem with total completion time objective
- Title not available (Why is that?)
- Two machine open shop scheduling problem with setup, processing and removal times separated
- Large-scale medical examination scheduling technology based on intelligent optimization
Cited In (21)
- Retraction note to: ``OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- Just-in-time scheduling problem with affine idleness cost
- An exact solution method for multi-manned disassembly line design with and/or precedence relations
- A Genetic Algorithm for the Batch Scheduling with Sequence-Dependent Setup Times
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
- Optimization for cooperative task planning of heterogeneous multi-robot systems in an order picking warehouse
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- Solving LTPSOP in open-pit mines using Gaussian process and human mental search
- 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
- New efficient heuristics for scheduling open shops with makespan minimization
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- Group-shop scheduling with sequence-dependent set-up and transportation times
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- Scheduling job shop problems with sequence-dependent setup times
- Competitive genetic algorithms for the open-shop scheduling problem
Uses Software
This page was built for publication: A genetic algorithm for scheduling open shops with sequence-dependent setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333145)
