Pages that link to "Item:Q1779690"

The following pages link to Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690):

Displaying 16 items.

• An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
• Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
• Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
• Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem (Q1754010) (← links)
• An exact approach for scheduling jobs with regular step cost functions on a single machine (Q1762077) (← links)
• Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941) (← links)
• Minimizing the makespan on a single machine subject to modular setups (Q2124915) (← links)
• A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs (Q2467257) (← links)
• Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)