Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
From MaRDI portal
Publication:3779990
DOI10.1287/mnsc.34.2.254zbMath0638.90056OpenAlexW1976006166MaRDI QIDQ3779990
Farhad M. E. Raiszadeh, Tapan Sen, Parthasarati Dileepan
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.2.254
Related Items (14)
An interactive procedure for bi-criteria production scheduling ⋮ Incorporating preference information into multi-objective scheduling ⋮ A bicriterion scheduling problem involving total flowtime and total tardiness ⋮ A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process ⋮ Multicriteria scheduling using fuzzy theory and tabu search ⋮ Minimizing the sum of weighted completion times with unrestricted weights ⋮ A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ A GRASP for a difficult single machine scheduling problem ⋮ A new lower bound approach for single-machine multicriteria scheduling ⋮ Single machine scheduling with flow time and earliness penalties ⋮ Multi‐objective optimization using metaheuristics: non‐standard algorithms ⋮ Multicriteria scheduling problems: a survey
This page was built for publication: Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
