Due dates assignment and JIT scheduling with equal-size jobs
type: Item
instance of: scholarly article
title: Due dates assignment and JIT scheduling with equal-size jobs
zbMATH Open document ID: 1188.90113
author: Nguyen Huynh Tuong
author: A. Soukhal
published in: European Journal of Operational Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5720396
zbMATH Keywords: multi-processor scheduling
zbMATH Keywords: due dates assignment
zbMATH Keywords: earliness-tardiness penalty
zbMATH Keywords: polynomial-time algorithms
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.01.016
OpenAlex ID: W1990496452
cites work: A Fast and Simple Algorithm for the Maximum Flow Problem
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: A new approach to the maximum-flow problem
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Q4667087
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
cites work: Q5519710
cites work: Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
cites work: Due-date assignment on uniform machines
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: Multicriteria scheduling problems: a survey
DOI: 10.1016/J.EJOR.2010.01.016
description: scientific article; zbMATH DE number 5720396