Scheduling orders for multiple product types with due date related objectives

DOI10.1016/J.EJOR.2004.03.030MaRDI QIDQ2569034zbMATH OpenOpenAlexFDO

Authors Joseph Y.-T. Leung, Haibing Li, 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

exact algorithmheuristicsNP-hardorder schedulingtotal number of late orders

Mathematics Subject Classification ID

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

Recommendations

• Order scheduling in an environment with dedicated resources in parallel
• Scheduling orders for multiple product types to minimize total weighted completion time
• scientific article; zbMATH DE number 2221456
• Scheduling multiple products on parallel machines with setup costs
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time

Cites work

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

Cited in

(26)

• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• Metaheuristics for order scheduling problem with unequal ready times
• Two-machine flowshop scheduling in a physical examination center
• Order scheduling with tardiness objective: improved approximate solutions
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Customer order scheduling to minimize the number of late jobs
• A learning-based two-stage optimization method for customer order scheduling
• Scheduling on parallel machines to minimise maximum lateness for the customer order problem
• Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
• scientific article; zbMATH DE number 6611746 (Why is no real title available?)
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• Multi-objective due-date setting in a make-to-order environment
• An order scheduling problem with position-based learning effect
• Scheduling multiple products on parallel machines with setup costs
• Note: Due-date Assignment to Multi-Job Customer Orders
• An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
• Stochastic customer order scheduling to minimize long-run expected order cycle time
• Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
• Customer order scheduling on a serial-batch machine in precast bridge construction
• New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: a computational evaluation
• Approximation algorithms for the parallel-machine customer order scheduling with weighted and submodular rejection penalties
• Minimizing maximum delivery completion time for order scheduling with rejection
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling orders for multiple product types to minimize total weighted completion time
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• Dynamic programming based algorithms for set multicover and multiset multicover problems

This page was built for publication: Scheduling orders for multiple product types with due date related objectives

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