Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

DOI10.1002/nav.20356zbMath1183.90206OpenAlexW1966754696MaRDI QIDQ5305562

Yeung, W. K., Cheng, T. C. Edwin, Oguz, Ceyda

Publication date: 22 March 2010

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20356

zbMATH Keywords

dynamic programmingdue windowNP-hardnessflow shop schedulingearly and tardy jobs

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review, A survey on scheduling problems with due windows, SINGLE MACHINE SCHEDULING WITH A LEARNING EFFECT AND A RATE-MODIFYING ACTIVITY, Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times, Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration, Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times, Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times, COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES, Bicriterion scheduling with a negotiable common due window and resource-dependent processing times, An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time

Cites Work

• Unnamed Item
• Single-machine scheduling with time windows and earliness/tardiness penalties
• Earliness-tardiness scheduling problems with a common delivery window
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• Minimizing tardy jobs in a flowshop with common due date
• Common due window size and location determination in a single machine scheduling problem
• Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Single-machine scheduling with a common due window