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

DOI10.1002/NAV.3800290114MaRDI QIDQ3328239zbMATH OpenOpenAlexFDO

Authors 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) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Scheduling with release dates on a single machine to minimize total weighted completion time
• Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
• A branch and bound algorithm to minimize total weighted tardiness on a single processor
• scientific article; zbMATH DE number 3858822

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution

Cited in

(36)

• A bicriterion scheduling problem involving total flowtime and total tardiness
• Target-oriented robust satisficing models for the single machine scheduling problems with release time
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
• scientific article; zbMATH DE number 2219122 (Why is no real title available?)
• Two very large-scale neighborhoods for single machine scheduling
• A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
• Effective heuristics for the single machine sequencing problem with ready times
• Machine Scheduling to Minimize Weighted Completion Times
• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• An algorithm for single machine sequencing with release dates to minimize maximum cost
• A Sequencing Problem with Release Dates and Clustered Jobs
• Two scheduling problems of minimizing the maximum weighted completion time
• Scheduling tasks with sequence-dependent processing times
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Genetic algorithms for the two-stage bicriteria flowshop problem
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
• Randomized mechanism design for decentralized network scheduling
• The weighted common due date single machine scheduling problem revisited
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
• Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• scientific article; zbMATH DE number 3858822 (Why is no real title available?)
• A mixed integer programming approach for the single machine problem with unequal release dates
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• scientific article; zbMATH DE number 830014 (Why is no real title available?)
• Scheduling a single machine to minimize a regular objective function under setup constraints
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
• Reducibility among single machine weighted completion time scheduling problems
• Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
• Efficient heuristics to minimize total flow time with release dates
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• Multiple and bicriteria scheduling: A literature survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328239)