Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion

DOI10.1016/J.EJOR.2020.12.006zbMath1487.90280OpenAlexW3111972328MaRDI QIDQ2030503

Yanyan Li

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.006

zbMATH Keywords

schedulinghierarchical criteriatotal completion timepreemptionrelease date

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ Single machine scheduling with release dates: a distributionally robust approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SRPT applied to bandwidth-sharing networks
• Solving a bicriterion scheduling problem
• Hybrid algorithm for sequencing with bicriteria
• Complexity of single machine, multi-criteria scheduling problems
• Preemptive scheduling with two minimax criteria
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
• A note on Pareto minimizing total completion time and maximum cost
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Scheduling with release dates and preemption to minimize multiple max-form objective functions
• Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
• A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
• Multicriteria scheduling
• Complexity of two dual criteria scheduling problems
• An algorithm for minimizing flow time and maximum earliness on a single machine
• Centralized Wireless Data Networks With User Arrivals and Departures
• Scheduling Problems with Two Competing Agents
• Scheduling with Multiple Performance Measures: The One-Machine Case
• A single-machine problem with multiple criteria
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• One machine sequencing to minimize mean flow time with minimum number tardy
• Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Multiagent Scheduling
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion