Pages that link to "Item:Q3328239"

The following pages link to Scheduling of a single machine to minimize total weighted completion time subject to release dates (Q3328239):

Displaying 21 items.

• A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
• Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
• A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times (Q941536) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720) (← links)
• Efficient heuristics to minimize total flow time with release dates (Q1195875) (← links)
• Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
• Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
• Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
• An iterative heuristic for the single machine dynamic total completion time scheduling problem (Q1919773) (← links)
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (Q2434281) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
• Effective heuristics for the single machine sequencing problem with ready times (Q3352822) (← links)
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure (Q3778533) (← links)
• A bicriterion scheduling problem involving total flowtime and total tardiness (Q4264495) (← links)
• Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates (Q5952071) (← links)
• A new dominance rule to minimize total weighted tardiness with unequal release dates. (Q5952443) (← links)
• Target-oriented robust satisficing models for the single machine scheduling problems with release time (Q6568456) (← links)