Order scheduling models: hardness and algorithms (original) (raw)
Related papers
Approximation algorithms for problems in scheduling with set-ups
Discrete Applied Mathematics, 2008
On the Approximability of Related Machine Scheduling Under Arbitrary Precedence
IEEE Transactions on Network and Service Management, 2021
On an on-line scheduling problem for parallel jobs
Information Processing Letters, 2002
Naval Research Logistics, 2006
A better lower bound for on-line scheduling
Information Processing Letters, 1994
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
Alfred Taudes, Stephan Westphal
Computers & Operations Research, 2011
Approximating Weighted Completion Time for Order Scheduling with Setup Times
arXiv (Cornell University), 2019
ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES
Online scheduling of bounded length jobs to maximize throughput
Journal of Scheduling, 2012
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
Mathematics of Operations Research, 1997
Improved competitive algorithms for online scheduling with partial job values
Theoretical Computer Science, 2004
An optimal online algorithm for single machine scheduling to minimize total general completion time
2012
Online scheduling on m uniform machines to minimize total (weighted) completion time
Theoretical Computer Science, 2009
Computers & Operations Research, 2020
Parallel machine batching and scheduling with deadlines
Journal of Scheduling, 2000
Approximation schemes for scheduling on parallel machines
Journal of Scheduling, 1998
Online scheduling of parallel jobs on two machines is 2-competitive
Operations Research Letters, 2008
Fast Approximation for Scheduling One Machine
Mathematics
Two parallel machine sequencing problems involving controllable job processing times
European Journal of Operational Research, 1993
APPROXIMATION ALGORITHMS FOR SCHEDULING UNRELATED PARALLEL MACHINES
MATHEMATICAL PROGRAMMING, 1990
Lower bounds for single-machine scheduling problems
Naval Research Logistics, 1990
Special cases of online parallel job scheduling
A Competitive Online Algorithm for a Parallel Job Scheduling Problem
Proceedings of the 12th IASTED International …, 2000
Online scheduling on uniform machines to minimize total (weighted) completion time
Theoretical Computer Science, 2009
Non-Approximability Results for Scheduling Problems with Minsum Criteria
INFORMS Journal on Computing, 2001
A note on unrelated parallel machine scheduling with time-dependent processing times
Journal of the Operational Research Society, 2009
Scheduling to minimize average completion time: offline and online algorithms
Mathematics of Operations Research, 1997
Scheduling orders for multiple product types to minimize total weighted completion time
Discrete Applied Mathematics, 2007
A Polynomial Algorithm for Sequencing Jobs with Release Dates and Delivery Times on Uniform Machines
2021
Online set packing and competitive scheduling of multi-part tasks
Proc. 29th …, 2010
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling, 2009