The following pages link to (Q3741388):
Displaying 7 items.
- Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
- Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)