Solving the flexible job shop scheduling problem with sequence-dependent setup times
From MaRDI portal
Publication:1681272
DOI10.1016/j.ejor.2017.08.021zbMath1374.90171OpenAlexW2747561859MaRDI QIDQ1681272
Liji Shen, Stéphane Dauzère-Pérès, Janis S. Neufeld
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.021
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (23)
A survey of job shop scheduling problem: the types and models ⋮ Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem ⋮ A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ Semiconductor final-test scheduling under setup operator constraints ⋮ A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time ⋮ Shop scheduling in manufacturing environments: a review ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ On competitive analysis for polling systems ⋮ A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation ⋮ Flexible job-shop scheduling with transportation resources ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ Energy cost efficient scheduling in flexible job-shop manufacturing systems ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ A worker constrained flexible job shop scheduling problem with sequence-dependent setup times ⋮ Corrigendum to: ``Solving the flexible job shop scheduling problem with sequence-dependent setup times ⋮ Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs ⋮ Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
Cites Work
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- An effective architecture for learning and evolving flexible job-shop schedules
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- An integrated tabu search algorithm for the lot streaming problem in job shops
- Job-shop scheduling with multi-purpose machines
- A global MILP model for FMS scheduling
- Multi-resource shop scheduling with resource flexibility
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times
- Effective neighbourhood functions for the flexible job shop problem
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- A survey of scheduling problems with setup times or costs
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A genetic algorithm for the flexible job-shop scheduling problem
- The Complexity of Flowshop and Jobshop Scheduling
- The Reactive Tabu Search
- A Fast Taboo Search Algorithm for the Job Shop Problem
- An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups
- Flexible job-shop scheduling problem under resource constraints
This page was built for publication: Solving the flexible job shop scheduling problem with sequence-dependent setup times
