On scheduling with ready-times, due-dates and vacations

DOI<53::AID-NAV3220390105>3.0.CO;2-C 10.1002/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO;2-CzbMath0764.90049OpenAlexW2032942052MaRDI QIDQ3990307

S. David Wu, V. Jorge Leon

Publication date: 28 June 1992

Full work available at URL: https://doi.org/10.1002/1520-6750(199202)39:1<53::aid-nav3220390105>3.0.co;2-c

zbMATH Keywords

single-machine schedulingbranch-and-boundimplicit enumerationready-time and due-date constraintsvacation constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem ⋮ New single machine and job-shop scheduling problems with availability constraints ⋮ Two machine scheduling under disruptions with transportation considerations ⋮ Rescheduling of identical parallel machines under machine eligibility constraints. ⋮ A game-theoretic control approach for job shops in the presence of disruptions ⋮ Single-machine scheduling with maintenance and repair rate-modifying activities ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability ⋮ Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints ⋮ Machine scheduling with a rate-modifying activity