Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements

DOI10.1016/j.cor.2016.04.023zbMath1349.90377OpenAlexW2343121647MaRDI QIDQ342448

Shi Qiang Liu, Erhan Kozan

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.04.023

zbMATH Keywords

heuristicsjob shop schedulingparallel machinemixed integer programmingblockingno-waitlimited-buffer

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items

A survey of job shop scheduling problem: the types and models ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ An integrated approach for scheduling health care activities in a hospital ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times

Uses Software

• OR-Library

Cites Work

• Scatter search with path relinking for the flexible job shop scheduling problem
• An integrated search heuristic for large-scale flexible job shop scheduling problems
• Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• Optimising a coal rail network under capacity constraints
• A rollout metaheuristic for job shop scheduling problems
• Job-shop scheduling with limited capacity buffers
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
• Cyclic job shop scheduling problems with blocking
• Ant colony optimization combined with taboo search for the job shop scheduling problem
• A filter-and-fan approach to the job shop scheduling problem
• A new neighborhood and tabu search for the blocking job shop
• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• Job-shop scheduling with multi-purpose machines
• Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
• Deterministic job-shop scheduling: Past, present and future
• Future paths for integer programming and links to artificial intelligence
• Job-shop scheduling with blocking and no-wait constraints
• Routing and scheduling in a flexible job shop by tabu search
• A very fast TS/SA algorithm for the job shop scheduling problem
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• A genetic algorithm for the flexible job-shop scheduling problem
• A fast tabu search algorithm for the group shop scheduling problem
• Multiple colony ant algorithm for job-shop scheduling problem
• An Algorithm for Solving the Job-Shop Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements