Minmax scheduling with job-classes and earliness-tardiness costs
type: Item
instance of: scholarly article
title: Minmax scheduling with job-classes and earliness-tardiness costs
zbMATH Open document ID: 1107.90022
author: Daniel Oron
author: Gur Mosheiov
published in: European Journal of Operational Research
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5078502
zbMATH Keywords: scheduling
zbMATH Keywords: earliness-tardiness cost
zbMATH Keywords: parallel machines
zbMATH Keywords: minmax
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.12.012
OpenAlex ID: W1987706776
cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
cites work: Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
cites work: The Asymptotic Optimality of the LPT Rule
cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
cites work: A dynamic programming method for single machine scheduling
cites work: Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
cites work: A heuristic for single machine scheduling with early and tardy costs
cites work: Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
cites work: The Single Machine Early/Tardy Problem
cites work: Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: Q4032003
cites work: Single machine scheduling with symmetric earliness and tardiness penalties
cites work: Algorithms for a class of single-machine weighted tardiness and earliness problems
DOI: 10.1016/J.EJOR.2005.12.012
description: scientific article; zbMATH DE number 5078502