A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden

DOI10.1016/0305-0548(87)90033-5zbMath0624.90044OpenAlexW2037003659MaRDI QIDQ579120

G. Keong Leong, Timothy D. Fry

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90033-5

zbMATH Keywords

flowtimesingle machine schedulingjob earlinessmeasure of inventory costs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Preemption in single machine earliness/tardiness scheduling, Minimizing the sum of weighted completion times with unrestricted weights, A GRASP for a difficult single machine scheduling problem, Single machine scheduling with flow time and earliness penalties, Multicriteria scheduling problems: a survey

Cites Work

• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• 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
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Sequencing to Minimize the Maximum Job Cost
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties