Preemptive multiprocessor order scheduling to minimize total weighted flowtime

DOI10.1016/J.EJOR.2007.05.052MaRDI QIDQ2482817zbMATH OpenOpenAlexFDO

Authors Joseph Y.-T. Leung, Chung-Yee Lee, C. W. Ng, Gilbert H. Young

Publication date 24 April 2008

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

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

zbMATH Keywords

flexible machinesheuristicsNP-hardorder schedulingtotal weighted completion time

Mathematics Subject Classification ID

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

Recommendations

• Scheduling orders for multiple product types to minimize total weighted completion time
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• scientific article; zbMATH DE number 6263704
• Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

Cites work

• A note on the complexity of the concurrent open shop problem
• Batching in single operation manufacturing systems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Open shops with jobs overlap
• Open shops with jobs overlap -- revisited
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Order scheduling in an environment with dedicated resources in parallel
• Preemptive Scheduling with Due Dates
• Scheduling multi-operation jobs on a single machine
• Scheduling parallel machines for the customer order problem
• Single machine hierarchical scheduling with customer orders and multiple job classes
• Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
• The customer order lead-time problem on parallel machines
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

Cited in

(9)

• Allowable processing orders in the accelerated cascade algorithm
• 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
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
• An order scheduling problem with position-based learning effect
• Solving customer order scheduling problems with an iterated greedy algorithm
• Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
• Customer order scheduling on a serial-batch machine in precast bridge construction
• Scheduling orders for multiple product types to minimize total weighted completion time

This page was built for publication: Preemptive multiprocessor order scheduling to minimize total weighted flowtime

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