Scheduling problemGenetic algorithmOilfieldCyclic steam stimulationIn this paper, the problem of optimal assignment of trailer-mounted steam generators for cyclic steam stimulation (CSS) of petroleum wells is formulated as a parallel uniform machines scheduling (PMS) problem with release dates. The total...
This paper studies a complex variation of the parallel machine scheduling (PMS) problem, as encountered at a Belgian producer of knitted fabrics. The aim is to assign jobs to unrelated parallel machines, minimising a weighted combination of job lateness and tardiness. Jobs are assigned specific rel...
We set out to encode the scheduling problem into propositional Boolean logic and determine the optimal makespan by repeatedly calling an off-the-shelf SAT solver. Moreover, we move one step further by encoding the problem into Partial Maximum Satisfiability (PMS), which is an optimized version ...
The goal is to schedule all of the requests non-preemptively in their start-time-end-time windows, subjecting to PM capacity constraints, such that the total busy time of all used PMs is minimized (called MinTBT-ON for abbreviation). This problem is a fundamental scheduling problem for ...
The parallel machine scheduling problem (PMSP) involves the optimized assignment of a set of jobs to a collection of parallel machines, which is a proper f
parallel machine schedulinggeographically dispersed production locationshybrid meta-heuristicchangeover interferencecase studyThis paper studies a complex variation of the parallel machine scheduling (PMS) problem, as encountered at a Belgian producer of knitted fabrics. The aim is to assign jobs to ...
The study considers a parallel machine scheduling (PMS) problem with time-dependent deterioration and multiple rate-modifying activities (RMAs). The objective of the problem is to simultaneously determine the number and positions of RMAs and a schedule of jobs on parallel machines to minimize the ...
The PMS algorithms are discussed. We have given up-to-date information on polynomially type of problems based on non-preemptive criteria. It is shown that parallel machine makespan-minimization problem is NP-hard even for the two-machine problem. Moreover, the two-machine problem can be solved...
scheduling decisions in multi-stage mine production timetabling, we introduce a novel integrated-planning-scheduling problem for considering the disturbances and variability of jobs’ sizes based on the theory of parallel-machine flow shop scheduling with lot streaming. This new problem is called the ...
The PMS algorithms are discussed. We have given up-to-date information on polynomially type of problems based on non-preemptive criteria. It is shown that parallel machine makespan-minimization problem is NP-hard even for the two-machine problem. Moreover, the two-machine problem can be solved...