Approximation schemes for parallel machine scheduling problems with controllable processing times
From MaRDI portal
Publication:1885962
DOI10.1016/S0305-0548(03)00101-1zbMath1068.68035MaRDI QIDQ1885962
Klaus Jansen, Monaldo Mastrolilli
Publication date: 12 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach ⋮ A survey of scheduling with controllable processing times ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Scheduling with tool changes to minimize total completion time under controllable machining conditions ⋮ Scheduling parallel CNC machines with time/cost trade-off considerations ⋮ Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost ⋮ Machine scheduling with resource dependent processing times ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost ⋮ Preemptive scheduling on uniform parallel machines with controllable job processing times ⋮ Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach ⋮ Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches ⋮ Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times ⋮ Scheduling jobs with time-resource tradeoff via nonlinear programming
Cites Work
- A survey of results for sequencing problems with controllable processing times
- Approximation algorithms for combinatorial problems
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- An approximation algorithm for the generalized assignment problem
- Single machine scheduling with discretely controllable processing times
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Proportionate flow shop with controllable processing times
- Scheduling with Deadlines and Loss Functions
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Scheduling Multiple Variable-Speed Machines
- Bounds for Certain Multiprocessing Anomalies
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
