Ideal schedules in parallel machine settings
type: Item
instance of: scholarly article
title: Ideal schedules in parallel machine settings
zbMATH Open document ID: 1487.90297
author: Xiaojuan Jiang
author: Kangbok Lee
author: Michael L. Pinedo
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7354603
zbMATH Keywords: scheduling
zbMATH Keywords: makespan
zbMATH Keywords: total completion time
zbMATH Keywords: precedence
zbMATH Keywords: eligibility
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.08.010
OpenAlex ID: W3063630510
cites work: The complexity of mean flow time scheduling problems with release times
cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
cites work: Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
cites work: Q4131656
cites work: Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
cites work: A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
cites work: Scheduling identical jobs with chain precedence constraints on two uniform machines
cites work: Complexity of scheduling problems with multi-purpose machines
cites work: Q3425131
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: An efficient algorithm for finding ideal schedules
cites work: Optimal scheduling for two-processor systems
cites work: Ideal preemptive schedules on two processors
cites work: Scheduling identical jobs on uniform parallel machines
cites work: Minimizing mean flow time with release time constraint
cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time
cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
cites work: Scheduling equal length jobs with eligibility restrictions
cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines
cites work: A Level Algorithm for Preemptive Scheduling
cites work: Minimizing total completion time for UET tasks with release time and outtree precedence constraints
cites work: Minimizing mean flow time for UET tasks
cites work: Q3217922
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Q3959420
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Scheduling jobs with equal processing times subject to machine eligibility constraints
cites work: Complexity of Scheduling under Precedence Constraints
cites work: Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
cites work: Scheduling with deadlines and loss functions
cites work: Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
cites work: Scheduling
cites work: The ``least flexible job first'' rule in scheduling and in queueing
cites work: A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
cites work: Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
cites work: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
cites work: NP-complete scheduling problems
DOI: 10.1016/J.EJOR.2020.08.010
description: scientific article; zbMATH DE number 7354603