Pages that link to "Item:Q1869685"
From MaRDI portal
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):
Displayed 10 items.
- 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)
- 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 global constraint for total weighted completion time for unary resources (Q2430362) (← 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)
- 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)