Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing

DOI10.1016/S0377-2217(99)00285-4MaRDI QIDQ1584823zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

multiprocessor no-wait job shopmultipurpose batch process industriesproduction schedulingsimulated annealing algorithm

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

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

Cites work

• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
• A Scheduling Problem^*
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Complexity of Scheduling Shops with No Wait in Process
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 4079162 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 798135 (Why is no real title available?)
• Job Shop Scheduling by Local Search
• No-wait shop scheduling: Computational complexity and approximate algorithms
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Some no-wait shops scheduling problems: Complexity aspect
• The complexity of scheduling jobs in repetitive manufacturing systems
• The job shop scheduling problem: Conventional and new solution techniques

Cited in

(31)

• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• Approximative procedures for no-wait job shop scheduling.
• On the exact solution of the no-wait flow shop problem with due date constraints
• A survey of scheduling problems with no-wait in process
• A heuristic to schedule flexible job-shop in a glass factory
• Makespan estimation in batch process industries: A comparison between regression analysis and neural networks
• An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
• A hybrid method for large-scale short-term scheduling of make-and-pack production processes
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• Surgical case scheduling as a generalized job shop scheduling problem
• 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
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
• A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups
• COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• 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
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
• Scheduling the flowshop with zero intermediate storage using chaotic discrete artificial bee algorithm
• Multi-objective scheduling for multi-product batch process with no-wait constraint
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness
• Syncrolift dry dock scheduling with a capacitated ship transfer system
• A hybrid policy for order acceptance in batch process industries
• Feasible insertions in job shop scheduling, short cycles and stable sets
• Heuristics for search sequencing under time-dependent probabilities of existence
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
• MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry

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)