Scheduling orders for multiple product types with due date related objectives

DOI10.1016/j.ejor.2004.03.030zbMath1099.90541OpenAlexW1976095286MaRDI QIDQ2569034

Haibing Li, Joseph Y.-T. Leung, Michael L. Pinedo

Publication date: 17 October 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.03.030

zbMATH Keywords

heuristicsNP-hardexact algorithmorder schedulingtotal number of late orders

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Customer order scheduling to minimize the number of late jobs ⋮ An order scheduling problem with position-based learning effect ⋮ Scheduling orders for multiple product types to minimize total weighted completion time ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time ⋮ Two-machine flowshop scheduling in a physical examination center ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ Dynamic programming based algorithms for set multicover and multiset multicover problems ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Open shops with jobs overlap -- revisited
• Order scheduling in an environment with dedicated resources in parallel
• Approximation algorithms for combinatorial problems
• Open shops with jobs overlap
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• The multidimensional 0-1 knapsack problem: an overview.
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints