Pages that link to "Item:Q4147829"

The following pages link to The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution (Q4147829):

Displayed 8 items.

• A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness (Q4297161) ‎ (← links)
• Minimizing a Quadratic Function of Job Lateness in the Single Machine System (Q4298534) ‎ (← links)
• Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach (Q4718640) ‎ (← links)
• Single-machine scheduling with deteriorating jobs (Q4909259) ‎ (← links)
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem (Q5168014) ‎ (← links)
• A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect (Q5255177) ‎ (← links)
• Some Scheduling Problems on a Single Machine with General Job Effects of Position-Dependent Learning and Start-Time-Dependent Deterioration (Q5255178) ‎ (← links)
• Designs for order-of-addition experiments (Q5861613) ‎ (← links)