Results 131 to 140 of about 9,841 (196)

Beam search algorithms for the early/tardy scheduling problem with release dates [PDF]

open access: yes
In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We present several heuristic algorithms based on the beam search technique. These algorithms include classical beam
Rui A. F. S. Alves, Jorge M. S. Valente
core  

Burnout Syndrome and Absenteeism Among Nursing Staff at a Secondary-Level Hospital in Western Mexico: A Gender-Based Cross-Sectional Analysis. [PDF]

open access: yesNurs Rep
Gómez-Ramos JJ   +6 more
europepmc   +1 more source

Polynomially solvable total tardiness problems: Review and extensions

open access: yes
This paper shows that all polynomially solvable cases of the single machine total tardiness problem center around or are direct extensions of three well known results for that problem. A new polynomially solvable case for the problem is developed as well.
Koulamas, C.
core  

Earliness-tardiness scheduling around almost equal due dates

open access: yes, 1997
Discusses the existence of another class of problems that are structurally less complicated than the general earliness-tardiness problem. Details of common due date problems; Logic behind Emmons' matching algorithm; List of earliness-tardiness problems ...
Hoogeveen, J.A. (Han)   +1 more
core  

Home - About - Disclaimer - Privacy