A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure

DOI10.1080/02522667.1987.10698896zbMath0637.90056OpenAlexW2327107442MaRDI QIDQ3778533

Tapan Sen, Farhad M. E. Raiszadeh, Parthasarati Dileepan

Publication date: 1987

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

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

zbMATH Keywords

branch-and-boundsingle machinemaximum latenessbicriterion schedulingrange of lateness

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Solving a bicriterion scheduling problem
• A bicriterion approach to time/cost trade-offs in sequencing
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Sequencing independent jobs with a single resource
• 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
• Job Shop Sequencing Problem on Two Machines with Time Lag Constraints

This page was built for publication: A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure