Pages that link to "Item:Q1374426"
From MaRDI portal
The following pages link to A single machine scheduling problem with common due window and controllable processing times (Q1374426):
Displaying 20 items.
- On scheduling around large restrictive common due windows (Q704121) (← links)
- Due-window assignment scheduling in the proportionate flow shop setting (Q827100) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← 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)
- Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Scheduling problems with a common due window assignment: a survey (Q2877536) (← links)
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times (Q2931172) (← links)
- Common due window size and location determination in a single machine scheduling problem (Q3157768) (← links)
- A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times (Q4632956) (← links)
- Single Machine Scheduling with a Common Delivery Window (Q4887716) (← links)
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (Q5059190) (← links)