Job-shop scheduling with blocking and no-wait constraints

DOI10.1016/S0377-2217(01)00338-1zbMath1082.90528MaRDI QIDQ1848398

Dario Pacciarelli, Alessandro Mascis

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

SchedulingNo-waitJob shopBlocking

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (72)

Scheduling trains with small stretch on a unidirectional line ⋮ A branch and bound algorithm for scheduling trains in a railway network ⋮ A disjunctive graph model and framework for constructing new train schedules ⋮ Scheduling of a job-shop problem with limited output buffers ⋮ Effective train routing selection for real-time traffic management: improved model and ACO parallel computing ⋮ Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events ⋮ Job-shop scheduling with limited capacity buffers ⋮ A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups ⋮ Feasible insertions in job shop scheduling, short cycles and stable sets ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem ⋮ Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers ⋮ A logic-based Benders decomposition for microscopic railway timetable planning ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ An Exact Decomposition Approach for the Real-Time Train Dispatching Problem ⋮ Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem ⋮ Large-scale periodic scheduling in time-sensitive networks ⋮ An integrated approach for scheduling health care activities in a hospital ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ A decentralised multi-agent system for rail freight traffic management ⋮ A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot ⋮ An optimization-based decision support tool for incremental train timetabling ⋮ Easy Cases of Deadlock Detection in Train Scheduling ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling ⋮ Approximative procedures for no-wait job shop scheduling. ⋮ A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management ⋮ Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations ⋮ Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs ⋮ A job-shop scheduling approach for optimising sugarcane rail operations ⋮ Railway track allocation: Models and methods ⋮ Review of real-time vehicle schedule recovery methods in transportation services ⋮ Cyclic job shop scheduling problems with blocking ⋮ Surgical case scheduling as a generalized job shop scheduling problem ⋮ Approaches to modeling train scheduling problems as job-shop problems with blocking constraints ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ A memetic algorithm for the job-shop with time-lags ⋮ Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources ⋮ A survey of scheduling problems with no-wait in process ⋮ A general model for cyclic machine scheduling problems ⋮ No-wait job shop scheduling: tabu search and complexity of subproblems ⋮ An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops ⋮ Real time management of a metro rail terminus ⋮ A model predictive control approach for discrete-time rescheduling in complex central railway station areas ⋮ Dispatching and coordination in multi-area railway traffic management ⋮ A new neighborhood and tabu search for the blocking job shop ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ A sequencing approach for creating new train timetables ⋮ A heuristic to schedule flexible job-shop in a glass factory ⋮ An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach ⋮ Scheduling manufacturing systems with blocking: a Petri net approach ⋮ The flexible blocking job shop with transfer and set-up times ⋮ Air traffic flow management with layered workload constraints ⋮ A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization ⋮ The blocking job shop with rail-bound transportation ⋮ Scheduling trains as a blocking parallel-machine job shop scheduling problem ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ Scheduling for multi-robot routing with blocking and enabling constraints ⋮ An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances ⋮ Complete local search with limited memory algorithm for no-wait job shops to minimize makespan ⋮ Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage ⋮ An optimization-based heuristic for the robotic cell problem ⋮ Multiple train repositioning operations in a railyard network ⋮ A heuristic approach to solving the train traffic re-scheduling problem in real time ⋮ Complexity of flowshop scheduling problems with a new blocking constraint ⋮ Job-shop scheduling with blocking and no-wait constraints ⋮ Train Scheduling on a Unidirectional Path ⋮ Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays

Uses Software

• JOBSHOP

Cites Work

• A practical use of Jackson's preemptive schedule for solving the job shop problem
• The one-machine sequencing problem
• A three-dimensional matching model for perishable production scheduling
• A branch and bound algorithm for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• A genetic algorithm for the job shop problem
• The permutation flow shop with buffers: A tabu search approach
• Job-shop scheduling with blocking and no-wait constraints
• An efficient algorithm for a job shop problem
• A mathematical programming model for scheduling steelmaking-continuous casting production
• Applying tabu search to the job-shop scheduling problem
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Flowshop scheduling with limited temporary storage
• Perishable Inventory Theory: A Review
• Job Shop Scheduling by Simulated Annealing
• A Computational Study of the Job-Shop Scheduling Problem
• Disjunctive Programming
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Problem and Heuristic Space Search Strategies for Job Shop Scheduling
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Predicting deadlock in store‐and‐forward networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Job-shop scheduling with blocking and no-wait constraints