Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
From MaRDI portal
Publication:1584823
DOI10.1016/S0377-2217(99)00285-4zbMath0970.90034OpenAlexW2170716909MaRDI QIDQ1584823
W. H. M. Raaymakers, Hoogeveen, J. A.
Publication date: 5 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00285-4
production schedulingsimulated annealing algorithmmultiprocessor no-wait job shopmultipurpose batch process industries
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (29)
Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems ⋮ An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem ⋮ A hybrid policy for order acceptance in batch process industries ⋮ Some local search algorithms for no-wait flow-shop problem with makespan criterion ⋮ 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 ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ Heuristics for search sequencing under time-dependent probabilities of existence ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Approximative procedures for no-wait job shop scheduling. ⋮ An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Surgical case scheduling as a generalized job shop scheduling problem ⋮ A survey of scheduling problems with no-wait in process ⋮ 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 evolutionary approach to rehabilitation patient scheduling: A case study ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ 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 ⋮ MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Complete local search with limited memory algorithm for no-wait job shops to minimize makespan ⋮ A multi-echelon integrated JIT inventory model using the time buffer and emergency borrowing policies to deal with random delivery lead times ⋮ Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm ⋮ Makespan estimation in batch process industries: A comparison between regression analysis and neural networks ⋮ A hybrid method for large-scale short-term scheduling of make-and-pack production processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
- Some no-wait shops scheduling problems: Complexity aspect
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- No-wait shop scheduling: Computational complexity and approximate algorithms
- The job shop scheduling problem: Conventional and new solution techniques
- The complexity of scheduling jobs in repetitive manufacturing systems
- Complexity of Scheduling Shops with No Wait in Process
- A Scheduling Problem*
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Job Shop Scheduling by Local Search
This page was built for publication: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
