scientific article
From MaRDI portal
Publication:4032003
DOI<229::AID-NAV3220400207>3.0.CO;2-R 10.1002/1520-6750(199303)40:2<229::AID-NAV3220400207>3.0.CO;2-RzbMath0779.90048MaRDI QIDQ4032003
Publication date: 4 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Preemption in single machine earliness/tardiness scheduling ⋮ Minmax scheduling with job-classes and earliness-tardiness costs ⋮ A comparison of lower bounds for the single-machine early/tardy problem ⋮ A new lower bounding scheme for the total weighted tardiness problem. ⋮ Single machine scheduling with family setups to minimize total earliness and tardiness ⋮ Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed ⋮ Single machine weighted earliness-tardiness penalty problem with a common due date ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties ⋮ Single machine scheduling with symmetric earliness and tardiness penalties