The parallel machine min-max weighted absolute lateness scheduling problem

DOI10.1002/1520-6750(199402)41:1%3C33::AID-NAV3220410104%3E3.0.CO;2-SMaRDI QIDQ4279270zbMATH OpenOpenAlexFDO

Authors Chung-Lun Li, T. C. Edwin Cheng

Publication date 15 March 1995

Full work available at URL https://doi.org/10.1002/1520-6750(199402)41:1%3C33::aid-nav3220410104%3E3.0.co;2-s

zbMATH Keywords

common due dateearlinessNP-hard problemoptimal non-preemptive job scheduleparallel machine min-max weighted absolute lateness problempolynomial time heuristictardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• Parallel machine earliness and tardiness scheduling with proportional weights
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

Cited in

(28)

• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
• Scheduling with batch setup times and earliness-tardiness penalties
• Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
• A survey of the state-of-the-art of common due date assignment and scheduling research
• The weighted fair sequences problem
• Scheduling job classes on uniform machines
• Single machine scheduling to minimize the number of early and tardy jobs
• Scheduling with a common due-window: polynomially solvable cases
• An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems
• Minimizing total tardiness in a scheduling problem with a learning effect
• An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
• A survey on scheduling problems with due windows
• Multicriteria scheduling problems: a survey
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness
• Minimizing the maximum of job with weighted lateness in a single machine problem
• Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
• Parallel machine scheduling with eligibility constraints: a composite dispatching rule to minimize total weighted tardiness
• Due-date assignment with asymmetric earliness–tardiness cost
• Hierarchical production planning and scheduling in a multi-product, batch process environment
• Minmax earliness-tardiness costs with unit processing time jobs
• A common due-data assignment problem on parallel identical machines
• Parallel machine scheduling with a common due window
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines

This page was built for publication: The parallel machine min-max weighted absolute lateness scheduling problem

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