Pages that link to "Item:Q1869685"

The following pages link to A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685):

Displaying 22 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
• Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem (Q1686431) (← links)
• Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance (Q1761146) (← links)
• Mathematical models for preemptive shop scheduling problems (Q1762150) (← links)
• Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
• Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm (Q2377225) (← links)
• A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
• Scheduling jobs on parallel machines to minimize a regular step total cost function (Q2434254) (← links)
• Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
• Fuzzy reasoning based on a new fuzzy rough set and its application to scheduling problems (Q2475920) (← links)
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
• Algorithms for Necklace Maps (Q2950591) (← links)
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)