Pages that link to "Item:Q1761994"
From MaRDI portal
The following pages link to Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994):
Displaying 16 items.
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- A hybrid differential evolution approach based on surrogate modelling for scheduling bottleneck stages (Q342190) (← links)
- Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575) (← links)
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
- Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720) (← links)
- An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. (Q1412717) (← links)
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates (Q1652182) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- A bucket indexed formulation for nonpreemptive single machine scheduling problems (Q2806861) (← links)
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
- ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME (Q3158889) (← links)
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs (Q3160580) (← links)
- Scheduling of a single machine to minimize total weighted completion time subject to release dates (Q3328239) (← links)
- A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time (Q3737197) (← links)
- (Q4017560) (← links)
- A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)