Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
From MaRDI portal
Publication:1145613
DOI10.1016/0377-2217(80)90087-9zbMath0445.90032OpenAlexW2079821423MaRDI QIDQ1145613
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90087-9
single machine schedulingbranch and bound approachminimization of weighted sum of completion timessecondary criterionSmith's algorithm
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items
Multiple and bicriteria scheduling: A literature survey ⋮ An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ An algorithm for single machine sequencing with deadlines to minimize total weighted completion time ⋮ A time indexed formulation of non-preemptive single machine scheduling problems ⋮ Single machine scheduling with flow time and earliness penalties ⋮ A branch and bound algorithm for minimizing weighted completion times with deadlines ⋮ Multicriteria scheduling problems: a survey ⋮ Structure of a simple scheduling polyhedron ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Scheduling unit processing time jobs on a single machine with multiple criteria
Cites Work
