Scheduling of a single machine to minimize total weighted completion time subject to release dates

DOI10.1002/nav.3800290114zbMath0539.90044OpenAlexW1997568326MaRDI QIDQ3328239

Salvatore Ricciardelli, Lucio Bianco

Publication date: 1982

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800290114

zbMATH Keywords

branch and bound algorithmComputational resultsone machine schedulingdominance sufficient conditionsnonpreemptive sequencingsequence independent processing times

Mathematics Subject Classification ID

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

Related Items (20)

A bicriterion scheduling problem involving total flowtime and total tardiness ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ An iterative heuristic for the single machine dynamic total completion time scheduling problem ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure ⋮ Single-machine scheduling with no idle time and release dates to~minimize a regular criterion ⋮ A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ Randomized mechanism design for decentralized network scheduling ⋮ A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times ⋮ Scheduling with release dates on a single machine to minimize total weighted completion time ⋮ Efficient heuristics to minimize total flow time with release dates ⋮ Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ Effective heuristics for the single machine sequencing problem with ready times ⋮ On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems ⋮ Genetic algorithms for the two-stage bicriteria flowshop problem

Cites Work

• Unnamed Item
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution

This page was built for publication: Scheduling of a single machine to minimize total weighted completion time subject to release dates