Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
From MaRDI portal
(Redirected from Publication:342448)
Recommendations
- The scheduling problem where multiple machines compete for a common local buffer
- Job-shop scheduling with limited capacity buffers
- Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers
- Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1
- Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach
Cites work
- A fast tabu search algorithm for the group shop scheduling problem
- A filter-and-fan approach to the job shop scheduling problem
- A genetic algorithm for the flexible job-shop scheduling problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A new neighborhood and tabu search for the blocking job shop
- A rollout metaheuristic for job shop scheduling problems
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- An Algorithm for Solving the Job-Shop Problem
- An integrated search heuristic for large-scale flexible job shop scheduling problems
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Cyclic job shop scheduling problems with blocking
- 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
- Job-shop scheduling with limited capacity buffers
- Job-shop scheduling with multi-purpose machines
- Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
- Multiple colony ant algorithm for job-shop scheduling problem
- Optimising a coal rail network under capacity constraints
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- Routing and scheduling in a flexible job shop by tabu search
- Scatter search with path relinking for the flexible job shop scheduling problem
- Scheduling trains as a blocking parallel-machine job shop scheduling problem
Cited in
(11)- A hybrid metaheuristic algorithm to optimise a real-world robotic cell
- An integrated approach for scheduling health care activities in a hospital
- A survey of job shop scheduling problem: the types and models
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
- scientific article; zbMATH DE number 4152123 (Why is no real title available?)
- A real-world mine excavators timetabling methodology in open-pit mining
- Efficient algorithms for flexible job shop scheduling with parallel machines
- Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
- Graph neural networks for job shop scheduling problems: a survey
- Multi-stage mine production timetabling with optimising the sizes of mining operations: an application of parallel-machine flow shop scheduling with lot streaming
- Job-shop scheduling problem with limited input buffers: mathematical models and solution methods
This page was built for publication: Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342448)
