A survey of scheduling problems with no-wait in process
A Allahverdi - European Journal of Operational Research, 2016 - Elsevier
Scheduling involving no-wait in process plays an important role in industries such as plastic,
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …
Learning scheduling algorithms for data processing clusters
Efficiently scheduling data processing jobs on distributed compute clusters requires complex
algorithms. Current systems use simple, generalized heuristics and ignore workload …
algorithms. Current systems use simple, generalized heuristics and ignore workload …
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve
the no-wait flowshop scheduling problem with both makespan and total flowtime criteria. The …
the no-wait flowshop scheduling problem with both makespan and total flowtime criteria. The …
A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems
O Engin, A Güçlü - Applied Soft Computing, 2018 - Elsevier
This paper proposes an effective new hybrid ant colony algorithm based on crossover and
mutation mechanism for no-wait flow shop scheduling with the criterion to minimize the …
mutation mechanism for no-wait flow shop scheduling with the criterion to minimize the …
A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem
H Li, X Li, L Gao - Applied soft computing, 2021 - Elsevier
With the development of globalization, distributed manufacturing has become one of the
main modes of manufacturing. The situation in which a number of heterogeneous factories …
main modes of manufacturing. The situation in which a number of heterogeneous factories …
Operating theatre planning
A Guinet, S Chaabane - International Journal of Production Economics, 2003 - Elsevier
N patients must be planned in an operating theatre over a medium term horizon (one or two
weeks). This operating theatre is composed of several operating rooms and of one recovery …
weeks). This operating theatre is composed of several operating rooms and of one recovery …
A discrete water wave optimization algorithm for no-wait flow shop scheduling problem
F Zhao, H Liu, Y Zhang, W Ma, C Zhang - Expert Systems with Applications, 2018 - Elsevier
In this paper, a discrete Water Wave Optimization algorithm (DWWO) is proposed to solve
the no-wait flowshop scheduling problem (NWFSP) with respect to the makespan criterion …
the no-wait flowshop scheduling problem (NWFSP) with respect to the makespan criterion …
Sequencing of jobs in some production system
J Grabowski, J Pempera - European journal of operational research, 2000 - Elsevier
We consider a real-life problem of scheduling clients orders in the production of concrete
blocks in a factory of building industry. This problem can be modelled as a hybrid flow shop …
blocks in a factory of building industry. This problem can be modelled as a hybrid flow shop …
An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem
This paper proposes a Tabu-mechanism improved iterated greedy (TMIIG) algorithm to
solve the no-wait flowshop scheduling problem with a makespan criterion. The idea of …
solve the no-wait flowshop scheduling problem with a makespan criterion. The idea of …
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
This paper presents a novel discrete differential evolution (DDE) algorithm for solving the no-
wait flow shop scheduling problems with makespan and maximum tardiness criteria. First …
wait flow shop scheduling problems with makespan and maximum tardiness criteria. First …