Pages that link to "Item:Q1142687"
From MaRDI portal
The following pages link to Complexity results for scheduling chains on a single machine (Q1142687):
Displaying 26 items.
- Network construction problems with due dates (Q319443) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- On single-machine scheduling without intermediate delays (Q955319) (← links)
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region (Q1014938) (← links)
- Packing different-sized circles into a rectangular container (Q1127229) (← links)
- Complexity results for scheduling chains on a single machine (Q1142687) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- How useful are preemptive schedules? (Q1413904) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- A note on the maximum number of on-time jobs on parallel identical machines. (Q1422366) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Single-machine scheduling with supporting tasks (Q1751119) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- An improved algorithm for the packing of unequal circles within a larger containing circle (Q1847187) (← links)
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem (Q2442499) (← links)
- New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
- Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals (Q2765599) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates (Q5961612) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Single-machine scheduling of multiple projects with controllable processing times (Q6167669) (← links)
