Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
DOI10.1016/J.IPL.2007.03.002zbMATH Open1184.68133OpenAlexW2092537840MaRDI QIDQ2379955FDOQ2379955
Authors: Joseph Y.-T. Leung, Haibing Li, Jiawei Zhang, Michael L. Pinedo 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.03.002
Recommendations
- 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
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime
- Order scheduling in an environment with dedicated resources in parallel
Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Preemptive Scheduling on Two-Processor Systems
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
- Scheduling parallel machines for the customer order problem
- A Level Algorithm for Preemptive Scheduling
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- The customer order lead-time problem on parallel machines
Cited In (13)
- Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- New approximate algorithms for the customer order scheduling problem with total completion time objective
- Order scheduling with tardiness objective: improved approximate solutions
- Quality of move-optimal schedules for minimizing total weighted completion time
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
- Modeling single machine preemptive scheduling problems for computational efficiency
- An order scheduling problem with position-based learning effect
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time
- Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
- 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
This page was built for publication: Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379955)
