A bicriterion scheduling problem involving total flowtime and total tardiness

DOI10.1080/02522667.1999.10699409zbMath0932.90015OpenAlexW2330195420MaRDI QIDQ4264495

Parthasarati Dileepan, Tapan Sen

Publication date: 22 September 1999

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

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

zbMATH Keywords

branch-and-boundjobshop schedulingtotal tardinesstotal flowtime

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Solving a bicriterion scheduling problem
• A bicriterion approach to time/cost trade-offs in sequencing
• A decomposition algorithm for the single machine total tardiness problem
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
• On the Single-machine Scheduling Problem with Tardiness Penalties
• 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
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A note on the extension of a result on scheduling with secondary criteria

This page was built for publication: A bicriterion scheduling problem involving total flowtime and total tardiness