Punctuality and idleness in just-in-time scheduling

DOI10.1016/j.ejor.2004.07.018zbMath1077.90031OpenAlexW2014424453MaRDI QIDQ2566707

Francis Sourd

Publication date: 28 September 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.018

zbMATH Keywords

Dynamic programmingDeviationBicriteria schedulingIdlenessOne-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

A survey on scheduling problems with due windows, Multicriteria scheduling

Cites Work

• Unnamed Item
• Scheduling around a small common due date
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Optimal timing of a sequence of tasks with general completion costs
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• PERT scheduling with convex cost functions.
• Single machine scheduling with symmetric earliness and tardiness penalties
• Machine scheduling with earliness, tardiness and non-execution penalties
• The one-machine problem with earliness and tardiness penalties
• Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
• Multicriteria scheduling problems: a survey
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing