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

DOI10.1080/02522667.1994.10699185MaRDI QIDQ4297161zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
• A bicriterion scheduling problem involving total flowtime and total tardiness
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
• Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
• Bicriterion scheduling in the two-machine flowshop

Cites work

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

Cited in

(2)

• A bicriterion scheduling problem involving total flowtime and total tardiness
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness

This page was built for publication: A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4297161)