Scheduling job classes on uniform machines
type: Item
instance of: scholarly article
title: Scheduling job classes on uniform machines
zbMATH Open document ID: 1251.90146
author: Enrique Gerstl
author: Gur Mosheiov
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6106556
zbMATH Keywords: scheduling
zbMATH Keywords: uniform machines
zbMATH Keywords: earliness
zbMATH Keywords: tardiness
zbMATH Keywords: minmax
zbMATH Keywords: heuristics
describes a project that uses: NLopt
MaRDI profile type: Publication
full work available at URL: j.cor.2011.08.004
OpenAlex ID: W2068693920
cites work: Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: Optimal total-work-content-power due-date determination and sequencing
cites work: The parallel machine min-max weighted absolute lateness scheduling problem
cites work: Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
cites work: A common due-data assignment problem on parallel identical machines
cites work: Minmax earliness-tardiness costs with unit processing time jobs
cites work: Due-date assignment with asymmetric earliness–tardiness cost
cites work: Minmax scheduling with job-classes and earliness-tardiness costs
cites work: Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
cites work: Q3793928
cites work: Early/tardy scheduling with sequence dependent setups on uniform parallel machines
cites work: Due-date assignment on uniform machines
cites work: Scheduling identical jobs and due-window on uniform machines
cites work: Scheduling Independent Tasks on Uniform Processors
cites work: The Asymptotic Optimality of the LPT Rule
cites work: Q4308910
cites work: Q4215359
DOI: 10.1016/J.COR.2011.08.004
Recommended article: Uniform machine scheduling of unit-time jobs subject to resource constraints
Recommended article: Scheduling identical jobs and due-window on uniform machines
Recommended article: Uniform machine scheduling with machine available constraints
Recommended article: Scheduling identical jobs on uniform parallel machines
Recommended article: Scheduling on Uniform Nonsimultaneous Parallel Machines
Recommended article: Q5431779
Recommended article: Q4363257
Recommended article: Batch scheduling on uniform machines to minimize total flow-time
description: scientific article; zbMATH DE number 6106556