A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting
In the scheduling literature, it is generally assumed that jobs are not split into sub-lots, or that
the number and size of sub-lots are limited or predetermined. These assumptions make the …
the number and size of sub-lots are limited or predetermined. These assumptions make the …
Scheduling of memory chips for final testing on parallel machines considering power constraints and deteriorating effects
This paper delves into the intricate scheduling strategies crucial for the final testing phase of
memory chip manufacturing within the semiconductor industry and other related sectors. It …
memory chip manufacturing within the semiconductor industry and other related sectors. It …
Weighted tardiness minimisation for unrelated machines with sequence-dependent and resource-constrained setups
Motivated by the need of quick job (re-) scheduling, we examine an elaborate scheduling
environment under the objective of total weighted tardiness minimisation. The examined …
environment under the objective of total weighted tardiness minimisation. The examined …
Self-growth learning-based machine scheduler to minimize setup time and tardiness in OLED display semiconductor manufacturing
This paper focuses on a scheduling problem of the evaporation and encapsulation (EVEN)
line in organic light-emitting diode (OLED) display manufacturing towards minimizing total …
line in organic light-emitting diode (OLED) display manufacturing towards minimizing total …
[HTML][HTML] Scheduling and batching with evolutionary algorithms in simulation–optimization of an industrial formulation plant
Industrial scheduling problems are usually characterized by a high complexity and in many,
if not all cases, a detailed representation of many specific features of the production process …
if not all cases, a detailed representation of many specific features of the production process …
An exact decomposition method for unrelated parallel machine scheduling with order acceptance and setup times
In this paper, an unrelated parallel machine scheduling problem is studied, where order
acceptance, sequence and machine-dependent setup times and the maximum available …
acceptance, sequence and machine-dependent setup times and the maximum available …
A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators
We examine a parallel machine scheduling problem with a job splitting property, sequence-
dependent setup times, and limited setup operators, for minimizing makespan. Jobs are split …
dependent setup times, and limited setup operators, for minimizing makespan. Jobs are split …
Solving an Unrelated Parallel Machines Scheduling Problem with machine-and job-dependent setups and precedence constraints considering Support Machines
ML Muñoz-Díaz, A Escudero-Santana… - Computers & Operations …, 2024 - Elsevier
Single-stage production planning problems are common in the academic literature and in
real-world environments. One of the least studied scenarios in the literature for this …
real-world environments. One of the least studied scenarios in the literature for this …
Minimization of maximum lateness on parallel machines with a single server and job release dates
This paper addresses the problem of scheduling independent jobs with release dates on
identical parallel machines with a single server. The goal consists in minimizing the …
identical parallel machines with a single server. The goal consists in minimizing the …
Job scheduling for maximum revenue on uniform, parallel machines with major and minor setups and job splitting
We consider a revenue maximization scheduling problem where jobs can be split on
parallel, uniform machines. By assuming that only major and minor setups exist between …
parallel, uniform machines. By assuming that only major and minor setups exist between …