A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

DOI10.1016/0166-218X(94)00071-5zbMath0854.68007OpenAlexW1990176814MaRDI QIDQ1917233

Eugeniusz Nowicki, Stanisław Zdrzałka

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00071-5

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Approximation schemes for parallel machine scheduling problems with controllable processing times, Bicriteria robotic cell scheduling, A survey of scheduling with controllable processing times, Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times, A multi-objective optimization for preemptive identical parallel machines scheduling problem, Pre-emptive scheduling problems with controllable processing times, Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach, Preemptive scheduling on uniform parallel machines with controllable job 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, Single machine scheduling with resource dependent release times and processing times, Scheduling two agents with controllable processing times, A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times, Solving multi-objective parallel machine scheduling problem by a modified NSGA-II, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, Multicriteria scheduling, A new bounding mechanism for the CNC machine scheduling problems with controllable processing times

Cites Work

• A survey of results for sequencing problems with controllable processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Scheduling with Deadlines and Loss Functions
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Preemptive Scheduling of Uniform Processor Systems
• The Theory of Networks and Management Science. Part I
• Unnamed Item