Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
type: Item
instance of: scholarly article
title: Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
zbMATH Open document ID: 1487.90280
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7356009
zbMATH Keywords: scheduling
zbMATH Keywords: hierarchical criteria
zbMATH Keywords: release date
zbMATH Keywords: preemption
zbMATH Keywords: total completion time
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.12.006
OpenAlex ID: W3111972328
cites work: SRPT applied to bandwidth-sharing networks
cites work: Multiagent Scheduling
cites work: Scheduling Problems with Two Competing Agents
cites work: Complexity of single machine, multi-criteria scheduling problems
cites work: Minimizing Mean Flow Time With Release Time and Deadline Constraints
cites work: One machine sequencing to minimize mean flow time with minimum number tardy
cites work: A note on Pareto minimizing total completion time and maximum cost
cites work: Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Multicriteria scheduling
cites work: Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
cites work: An algorithm for minimizing flow time and maximum earliness on a single machine
cites work: Complexity of two dual criteria scheduling problems
cites work: A single-machine problem with multiple criteria
cites work: Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy
cites work: Q3217922
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Q3048571
cites work: Q4821818
cites work: Hybrid algorithm for sequencing with bicriteria
cites work: Scheduling with Multiple Performance Measures: The One-Machine Case
cites work: Q3525911
cites work: Centralized Wireless Data Networks With User Arrivals and Departures
cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
cites work: Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
cites work: Preemptive scheduling with two minimax criteria
cites work: Q3378953
cites work: Solving a bicriterion scheduling problem
cites work: A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
cites work: Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
cites work: Scheduling with release dates and preemption to minimize multiple max-form objective functions
DOI: 10.1016/J.EJOR.2020.12.006
description: scientific article; zbMATH DE number 7356009