Optimal timing schedules in earliness-tardiness single machine sequencing
From MaRDI portal
Publication:4859570
DOI<1109::AID-NAV3220420709>3.0.CO;2-5 10.1002/1520-6750(199510)42:7<1109::AID-NAV3220420709>3.0.CO;2-5zbMath0841.90078OpenAlexW2018859068MaRDI QIDQ4859570
Samar K. Mukhopadhyay, Wlodzimierz Szwarc
Publication date: 24 July 1996
Full work available at URL: https://doi.org/10.1002/1520-6750(199510)42:7<1109::aid-nav3220420709>3.0.co;2-5
Related Items (21)
Preemption in single machine earliness/tardiness scheduling ⋮ Machine scheduling with earliness, tardiness and non-execution penalties ⋮ Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties ⋮ An improved earliness--tardiness timing algorithm ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence ⋮ Multicriteria models for just-in-time scheduling ⋮ Efficient algorithms for machine scheduling problems with earliness and tardiness penalties ⋮ A recovering beam search algorithm for the single machine just-in-time scheduling problem ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert ⋮ Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem ⋮ Optimal timing of a sequence of tasks with general completion costs ⋮ Earliness-tardiness scheduling with setup considerations ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties ⋮ The one-machine just-in-time scheduling problem with preemption ⋮ A new model for the preemptive earliness-tardiness scheduling problem ⋮ Earliness and tardiness single machine scheduling with proportional weights ⋮ Punctuality and idleness in just-in-time scheduling ⋮ Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert ⋮ Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties ⋮ PERT scheduling with convex cost functions.
This page was built for publication: Optimal timing schedules in earliness-tardiness single machine sequencing
