Optimization-based scheduling method for agile earth-observing satellite constellation
This Paper proposes a two-step binary linear programming formulation for task scheduling
of a constellation of low-Earth-orbit satellites and demonstrates its applicability and …
of a constellation of low-Earth-orbit satellites and demonstrates its applicability and …
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
This research is motivated by a scheduling problem found in the diffusion and oxidation
areas of semiconductor wafer fabrication, where the machines can be modeled as parallel …
areas of semiconductor wafer fabrication, where the machines can be modeled as parallel …
Iterated greedy algorithms for a complex parallel machine scheduling problem
This paper addresses a complex parallel machine scheduling problem with jobs divided into
operations and operations grouped in families. Non-anticipatory family setup times are held …
operations and operations grouped in families. Non-anticipatory family setup times are held …
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
DP Ronconi, LRS Henriques - Omega, 2009 - Elsevier
The flowshop scheduling problem with blocking in-process is addressed in this paper. In this
environment, there are no buffers between successive machines; therefore intermediate …
environment, there are no buffers between successive machines; therefore intermediate …
Bi-objective optimization of identical parallel machine scheduling with flexible maintenance and job release times
Y Chen, Z Guan, C Wang, F Chou… - International Journal of …, 2022 - m.growingscience.com
This paper investigates an identical parallel machine scheduling problem with flexible
maintenance and job release times and attempts to optimize two objectives: the …
maintenance and job release times and attempts to optimize two objectives: the …
Metaheuristics for a scheduling problem with rejection and tardiness penalties
In this paper, we consider a single-machine scheduling problem (P) inspired from
manufacturing instances. A release date, a deadline, and a regular (ie, non-decreasing) cost …
manufacturing instances. A release date, a deadline, and a regular (ie, non-decreasing) cost …
The single-machine total weighted tardiness scheduling problem with position-based learning effects
Y Yin, CC Wu, WH Wu, SR Cheng - Computers & Operations Research, 2012 - Elsevier
This study addresses the problem of minimizing the total weighted tardiness on a single-
machine with a position-based learning effect. Several dominance properties are …
machine with a position-based learning effect. Several dominance properties are …
A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines
A Bilyk, L Mönch - Journal of Intelligent Manufacturing, 2012 - Springer
In this paper, we study a planning and scheduling problem for unrelated parallel machines.
There are n jobs that have to be assigned and sequenced on m unrelated parallel …
There are n jobs that have to be assigned and sequenced on m unrelated parallel …
Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems
In this paper, a genetic algorithm with injecting artificial chromosomes is developed to solve
the single machine scheduling problems. Artificial chromosomes are generated according to …
the single machine scheduling problems. Artificial chromosomes are generated according to …
Shifting bottleneck scheduling for total weighted tardiness minimization—A computational evaluation of subproblem and re-optimization heuristics
R Braune, G Zäpfel - Computers & Operations Research, 2016 - Elsevier
Abstract Machine-based decomposition of total weighted tardiness job shops is known to be
considerably more complicated than in the makespan case, mainly due to the structure of …
considerably more complicated than in the makespan case, mainly due to the structure of …