Pages that link to "Item:Q1593519"
From MaRDI portal
The following pages link to A permutation flow-shop scheduling problem with convex models of operation processing times (Q1593519):
Displayed 11 items.
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- Job-shop scheduling with convex models of operations (Q1341401) (← links)
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Single-machine group scheduling with deteriorating jobs and allotted resource (Q2448141) (← links)
- Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)
- Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
- SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN (Q3052719) (← links)
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)
- Two-machine flow shop scheduling with convex resource consumption functions (Q6097489) (← links)
