A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness

DOI10.1080/02522667.1994.10699185zbMath0801.90066OpenAlexW2063178966MaRDI QIDQ4297161

Tapan Sen, Brian W. Scott

Publication date: 8 August 1994

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1994.10699185

zbMATH Keywords

bicriterion schedulingmaximum tardinessbranch-and- boundsquared flowtime

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Solving a bicriterion scheduling problem
• A bicriterion approach to time/cost trade-offs in sequencing
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
• A note on a scheduling problem with dual criteria
• One machine sequencing to minimize mean flow time with minimum number tardy
• Scheduling to minimize the weighted sum of completion times with secondary criteria
• A dual algorithm for the one-machine scheduling problem
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• A note on the extension of a result on scheduling with secondary criteria
• Job Shop Sequencing Problem on Two Machines with Time Lag Constraints