Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
From MaRDI portal
Publication:1584823
DOI10.1016/S0377-2217(99)00285-4zbMATH Open0970.90034OpenAlexW2170716909MaRDI QIDQ1584823FDOQ1584823
Authors: W. H. M. Raaymakers, Han Hoogeveen 
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
Recommendations
- Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
- A multi-objective production scheduling case study solved by simulated annealing
- Multi-objective scheduling for multi-product batch process with no-wait constraint
- Some new results on simulated annealing applied to the job shop scheduling problem
- Scheduling multi-purpose batch plants with junction constraints
production schedulingsimulated annealing algorithmmultiprocessor no-wait job shopmultipurpose batch process industries
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of scheduling jobs in repetitive manufacturing systems
- Complexity of Scheduling Shops with No Wait in Process
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- The job shop scheduling problem: Conventional and new solution techniques
- Job Shop Scheduling by Local Search
- Some no-wait shops scheduling problems: Complexity aspect
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
- Title not available (Why is that?)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- No-wait shop scheduling: Computational complexity and approximate algorithms
- Title not available (Why is that?)
- A Scheduling Problem*
Cited In (30)
- 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
- A hybrid method for large-scale short-term scheduling of make-and-pack production processes
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- Makespan estimation in batch process industries: A comparison between regression analysis and neural networks
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- Feasible insertions in job shop scheduling, short cycles and stable sets
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- Heuristics for search sequencing under time-dependent probabilities of existence
- A hybrid policy for order acceptance in batch process industries
- On the exact solution of the no-wait flow shop problem with due date constraints
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
- No-wait job shop scheduling: tabu search and complexity of subproblems
- Multi-objective scheduling for multi-product batch process with no-wait constraint
- Scheduling the flowshop with zero intermediate storage using chaotic discrete artificial bee algorithm
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- A heuristic to schedule flexible job-shop in a glass factory
- MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
- Approximative procedures for no-wait job shop scheduling.
- Surgical case scheduling as a generalized job shop scheduling problem
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- An evolutionary approach to rehabilitation patient scheduling: A case study
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- A multi-echelon integrated JIT inventory model using the time buffer and emergency borrowing policies to deal with random delivery lead times
- A survey of scheduling problems with no-wait in process
This page was built for publication: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584823)
