An algorithm for single machine sequencing with release dates to minimize total weighted completion time
From MaRDI portal
Publication:1171502
DOI10.1016/0166-218X(83)90019-7zbMath0498.90044OpenAlexW1983196874MaRDI QIDQ1171502
A. M. A. Hariri, Chris N. Potts
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(83)90019-7
Lagrangean relaxationsingle machinecomputational resultsheuristic algorithmbranch and bound algorithmn jobsminimization of overall completion timesequencing with release datesweighted completion times
Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35)
Related Items (39)
A robust approach for the single machine scheduling problem ⋮ A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties ⋮ Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. ⋮ Dominance-based heuristics for one-machine total cost scheduling problems ⋮ A hybrid heuristic approach for single machine scheduling with release times ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time ⋮ An iterative heuristic for the single machine dynamic total completion time scheduling problem ⋮ Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time ⋮ Single machine batch scheduling with release times and delivery costs ⋮ 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 ⋮ Formulating the single machine sequencing problem with release dates as a mixed integer program ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ An algorithm for single machine sequencing with deadlines to minimize total weighted completion time ⋮ Scheduling with release dates on a single machine to minimize total weighted completion time ⋮ Efficient heuristics to minimize total flow time with release dates ⋮ 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 ⋮ Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ An efficient ILP formulation for the single machine scheduling problem ⋮ 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 ⋮ An exact approach to early/tardy scheduling with release dates ⋮ Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem ⋮ 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 ⋮ Modeling single machine preemptive scheduling problems for computational efficiency ⋮ Single machine earliness and tardiness scheduling ⋮ A branch and bound algorithm for the two-stage assembly scheduling problem ⋮ Cellular control of manufacturing systems ⋮ Scheduling identical parallel machines to minimize total weighted completion time
Cites Work
This page was built for publication: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
