Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
type: Item
instance of: scholarly article
title: Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
zbMATH Open document ID: 1144.90403
author: Gwo-Ji Sheen
author: Lu-Wen Liao
published in: Computers \& Operations Research
publication date: 2007-02-26T00:00:00Z
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 5129816
zbMATH Keywords: scheduling
zbMATH Keywords: machines with identical speed
zbMATH Keywords: lateness
zbMATH Keywords: network flows
zbMATH Keywords: binary search
zbMATH Keywords: availability constraint
zbMATH Keywords: eligibility constraint
MaRDI profile type: Publication
full work available at URL: j.cor.2005.09.002
OpenAlex ID: W2065038227
cites work: Q4023677
cites work: Scheduling Independent Tasks with Deadlines on Semi-identical Processors
cites work: Scheduling preemptable tasks on parallel processors with limited availability
cites work: Scheduling multiprocessor tasks on parallel processors with limited availability.
cites work: Current trends in deterministic scheduling
cites work: Scheduling with limited machine availability
cites work: Minimizing makespan on parallel machines with release time and machine eligibility restrictions
cites work: Parallel machine scheduling under a grade of service provision
cites work: NP-complete scheduling problems
cites work: Parallel machines scheduling with machine shutdowns
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: Machine scheduling with an availability constraint
cites work: A note on ''parallel machine scheduling with non-simultaneous machine available time''
cites work: Q3525911
cites work: Parallel machine scheduling of machine-dependent jobs with unit-length.
cites work: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
cites work: Q3217922
cites work: Q3962462
cites work: Q3056948
cites work: Q3048571
cites work: Scheduling with deadlines and loss functions
DOI: 10.1016/J.COR.2005.09.002
Recommended article: Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
Recommended article: Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
Recommended article: Scheduling on parallel identical machines to minimize total tardiness
Recommended article: Scheduling on uniform parallel machines to minimize maximum lateness
Recommended article: Machine scheduling with an availability constraint and job delivery coordination
Recommended article: Parallel-machine scheduling with time-dependent and machine availability constraints
Recommended article: Optimal parallel machines scheduling with availability constraints
Recommended article: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
Recommended article: Scheduling jobs with equal processing times subject to machine eligibility constraints
Recommended article: Machine scheduling with availability constraints
description: scientific article; zbMATH DE number 5129816