The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
type: Item
instance of: scholarly article
title: The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
zbMATH Open document ID: 1151.90432
author: Dvir Shabtay
author: George Steiner
published in: Annals of Operations Research
publication date: 2008-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 5320601
zbMATH Keywords: single-machine scheduling
zbMATH Keywords: due date assignment
zbMATH Keywords: controllable processing times
zbMATH Keywords: resource allocation
zbMATH Keywords: earliness-tardiness scheduling
MaRDI profile type: Publication
full work available at URL: s10479-007-0269-y
OpenAlex ID: W2150902201
cites work: Single Machine Scheduling with Flow Allowances
cites work: Two parallel machine sequencing problems involving controllable job processing times
cites work: Cost-effectiveness of a preventive counseling and support package for postnatal depression
cites work: Solving a class of two-resource allocation problem by equivalent load method
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: A multi-objective approach to resource allocation in single machine scheduling
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
cites work: Some comments on sequencing with controllable processing times
cites work: Q3775317
cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
cites work: Single machine scheduling with a variable common due date and resource-dependent processing times.
cites work: A survey of results for sequencing problems with controllable processing times
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: Single-machine sequencing with controllable processing times
cites work: Q4739657
cites work: Allocation of resources in project management
cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
cites work: Minimizing the total weighted flow time in a single machine with controllable processing times
cites work: Two due date assignment problems in scheduling a single machine
cites work: A survey of scheduling with controllable processing times
cites work: Manufacturing lead-time rules: customer retention versus tardiness costs
cites work: A bicriterion approach to time/cost trade-offs in sequencing
cites work: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
DOI: 10.1007/S10479-007-0269-Y
description: scientific article; zbMATH DE number 5320601