scientific article; zbMATH DE number 151905

DOI10.1002/1520-6750(199303)40:2%3C229::AID-NAV3220400207%3E3.0.CO;2-RMaRDI QIDQ4032003zbMATH OpenFDO

Authors Wlodzimierz Szwarc

Publication date 4 May 1993

zbMATH Keywords

lower boundpenaltiesbranch-and- boundsingle-machine \(n\) job earliness-tardiness model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling with symmetric earliness and tardiness penalties
• Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
• Single-machine scheduling with time windows and earliness/tardiness penalties
• OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
• Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties
• Optimal timing schedules in earliness-tardiness single machine sequencing
• Scheduling with earliness-tardiness penalties and parallel machines
• Machine scheduling with earliness, tardiness and non-execution penalties
• On the Single-machine Scheduling Problem with Tardiness Penalties
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

Cited in

(10)

• Counting and enumeration complexity with application to multicriteria scheduling
• 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
• Minmax scheduling with job-classes and earliness-tardiness costs
• Single machine scheduling with symmetric earliness and tardiness penalties
• Preemption in single machine earliness/tardiness scheduling
• A comparison of lower bounds for the single-machine early/tardy problem
• Single machine weighted earliness-tardiness penalty problem with a common due date
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• A new lower bounding scheme for the total weighted tardiness problem.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032003)