Approximative procedures for no-wait job shop scheduling.
From MaRDI portal
Publication:1413924
DOI10.1016/S0167-6377(03)00005-1zbMath1041.90019MaRDI QIDQ1413924
Jose M. Framinan, Christoph J. Schuster
Publication date: 17 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Feasible insertions in job shop scheduling, short cycles and stable sets, A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, A heuristic to schedule flexible job-shop in a glass factory, Some local search algorithms for no-wait flow-shop problem with makespan criterion, A memetic algorithm for the job-shop with time-lags, No-wait job shop scheduling: tabu search and complexity of subproblems, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem, An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops, An evolutionary approach to rehabilitation patient scheduling: A case study, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach, A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups, Model formulations for the machine scheduling problem with limited waiting time constraints, Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Uses Software
Cites Work
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- A genetic algorithm for flowshop sequencing
- Sequencing of jobs in some production system
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Deterministic job-shop scheduling: Past, present and future
- Job-shop scheduling with blocking and no-wait constraints
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- Complexity of Scheduling Shops with No Wait in Process
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- Ordonnancements à contraintes disjonctives
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- A Scheduling Problem*
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- An effective hybrid optimization strategy for job-shop scheduling problems
- Variable neighborhood search: Principles and applications
