Approximation schemes for parallel machine scheduling problems with controllable processing times

DOI10.1016/S0305-0548(03)00101-1MaRDI QIDQ1885962zbMATH OpenFDO

Authors Klaus Jansen, Monaldo Mastrolilli

Publication date 12 November 2004

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(03)00101-1

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A 32-approximation algorithm for parallel machine scheduling with controllable processing times
• Approximation schemes for scheduling on parallel machines
• scientific article; zbMATH DE number 2051966
• Approximation schemes for parallel machine scheduling with availability constraints
• Approximation schemes for job shop scheduling problems with controllable processing times
• An approximation algorithm for a parallel machine scheduling problem with constraints
• scientific article; zbMATH DE number 5951383
• Just-in-time scheduling with controllable processing times on parallel machines
• A linear time approximation scheme for the single machine scheduling problem with controllable processing times
• A parallel approximation scheme for the multiprocessor scheduling problem

Cites work

• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
• A survey of results for sequencing problems with controllable processing times
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
• An approximation algorithm for the generalized assignment problem
• Approximation algorithms for combinatorial problems
• Bounds for Certain Multiprocessing Anomalies
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• scientific article; zbMATH DE number 2089208 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2044496 (Why is no real title available?)
• Proportionate flow shop with controllable processing times
• Scheduling Multiple Variable-Speed Machines
• Scheduling with deadlines and loss functions
• Single machine scheduling with discretely controllable processing times

Cited in

(25)

• Scheduling jobs with time-resource tradeoff via nonlinear programming
• Notes on max flow time minimization with controllable processing times
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
• A survey of scheduling with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• scientific article; zbMATH DE number 2089208 (Why is no real title available?)
• scientific article; zbMATH DE number 5951383 (Why is no real title available?)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
• A linear time approximation scheme for the single machine scheduling problem with controllable processing times
• Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
• Preemptive scheduling of parallel jobs of two sizes with controllable processing times
• Approximation schemes for parallel machine scheduling to maximize total weighted early work with a common due date
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling 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
• Machine scheduling with resource dependent processing times
• Preemptive scheduling on uniform parallel machines with controllable job processing times
• Just-in-time scheduling with controllable processing times on parallel machines

This page was built for publication: Approximation schemes for parallel machine scheduling problems with controllable processing times

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