Minimizing flowtime and missed due-dates in single-machine sequencing

DOI10.1016/0895-7177(90)90043-MzbMath0719.90041OpenAlexW2042916753MaRDI QIDQ2640435

Cheng, T. C. Edwin

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(90)90043-m

zbMATH Keywords

NP-hardsingle machine sequencingTotal Discrepancy Problemweighted sum of flowtime and earliness/tardiness values

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

On the monotonicity of the critical time in the constrained-degree percolation model ⋮ Bicriterion scheduling with equal processing times on a batch processing machine ⋮ A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems ⋮ BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey of scheduling research involving due date determination decisions
• The art and theory of dynamic programming
• A Dynamic Programming Approach to Sequencing Problems
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Minimizing mean absolute deviation of completion times about a common due date
• Single- and multiple-processor models for minimizing completion time variance
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• Minimizing the average deviation of job completion times about a common due-date: An extension
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties