Group sequencing around a common due date
type: Item
instance of: scholarly article
title: Group sequencing around a common due date
zbMATH Open document ID: 1170.90388
author: B. E. Eshmatov
published in: Discrete Optimization
publication date: 2008-08-15T00:00:00Z
full work available at URL: http://hdl.handle.net/10397/1263
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5312363
zbMATH Keywords: single machine scheduling
zbMATH Keywords: group technology
zbMATH Keywords: earliness-tardiness
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
OpenAlex ID: W2017381118
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Q4198056
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
cites work: Single machine group scheduling with ordered criteria
cites work: Single machine group scheduling with resource dependent setup and processing times
cites work: Sequencing with ordered criteria, precedence and group technology constraints
cites work: Q4841760
cites work: Minimizing the number of late jobs under the group technology assumption
cites work: Group scheduling with controllable setup and processing times: minimizing total weighted completion time
cites work: Scheduling with batching: A review
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: The complexity of scheduling job families about a common due date
DOI: 10.1016/J.DISOPT.2006.04.003
description: scientific article; zbMATH DE number 5312363