A survey of scheduling problems with setup times or costs
The first comprehensive survey paper on scheduling problems with separate setup times or
costs was conducted by [Allahverdi, A., Gupta, JND, Aldowaisan, T., 1999. A review of …
costs was conducted by [Allahverdi, A., Gupta, JND, Aldowaisan, T., 1999. A review of …
A review on job shop scheduling with setup times
Job shop scheduling problems with setup times arise in many practical situations such as
aerospace industries, fabrication industries, printing industries and semiconductor …
aerospace industries, fabrication industries, printing industries and semiconductor …
A multi-population, multi-objective memetic algorithm for energy-efficient job-shop scheduling with deteriorating machines
This paper focuses on an energy-efficient job-shop scheduling problem within a machine
speed scaling framework, where productivity is affected by deterioration. To alleviate the …
speed scaling framework, where productivity is affected by deterioration. To alleviate the …
[HTML][HTML] Application of quantum approximate optimization algorithm to job shop scheduling problem
K Kurowski, T Pecyna, M Slysz, R Różycki… - European Journal of …, 2023 - Elsevier
Abstract The Job Shop Scheduling Problem (JSSP) has always been considered as one of
the most complex and industry essential scheduling problems. Optimizing the makespan of …
the most complex and industry essential scheduling problems. Optimizing the makespan of …
A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions
V Sels, N Gheysen, M Vanhoucke - International Journal of …, 2012 - Taylor & Francis
In this paper, a comparison and validation of various priority rules for the job shop
scheduling problem under different objective functions is made. In a first computational …
scheduling problem under different objective functions is made. In a first computational …
Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity
Priority rules combined with schedule generation schemes are a usual approach to online
scheduling. These rules are commonly designed by experts on the problem domain …
scheduling. These rules are commonly designed by experts on the problem domain …
A reinforcement learning based multi-method approach for stochastic resource constrained project scheduling problems
Abstract The Resource-Constrained Project Scheduling Problem (RCPSP) has been widely
accepted as a challenging research topic due to its NP-hard nature. Because of the dynamic …
accepted as a challenging research topic due to its NP-hard nature. Because of the dynamic …
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan
Production Scheduling problems are typically named bases on the processing routes of their
jobs on different processors and also the number of processors in each stage. In this paper …
jobs on different processors and also the number of processors in each stage. In this paper …
A branch and bound method for the job-shop problem with sequence-dependent setup times
C Artigues, D Feillet - Annals of Operations Research, 2008 - Springer
This paper deals with the job-shop scheduling problem with sequence-dependent setup
times. We propose a new method to solve the makespan minimization problem to optimality …
times. We propose a new method to solve the makespan minimization problem to optimality …
Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time
On-line scheduling is often required in a number of real-life settings. This is the case of
distributing charging times for a large fleet of electric vehicles arriving stochastically to a …
distributing charging times for a large fleet of electric vehicles arriving stochastically to a …