Tradeoff between setup times and carrying costs for finished items

DOI10.1016/0305-0548(93)90057-PzbMath0801.90064OpenAlexW2079771058MaRDI QIDQ690011

Ching-Jong Liao

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90057-p

zbMATH Keywords

branch-and-boundmultiple job class problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Customer order scheduling on a single machine with family setup times: complexity and algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Single facility multi-class job scheduling
• Optimal schedules for single facility with two job classes
• Single facility scheduling with multiple job classes
• Solving a bicriterion scheduling problem
• Scheduling with Multiple Performance Measures: The One-Machine Case
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• A note on a scheduling problem with dual criteria
• One machine sequencing to minimize mean flow time with minimum number tardy