Pages that link to "Item:Q3896830"
From MaRDI portal
The following pages link to Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine (Q3896830):
Displayed 14 items.
- Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
- Single machine common flow allowance scheduling with controllable processing times (Q2504094) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times (Q2566700) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES (Q2931728) (← links)
- Bicriteria robotic cell scheduling with controllable processing times (Q2997880) (← links)
- Scheduling with controllable processing times and compression costs using population-based heuristics (Q3168916) (← links)
- Scheduling jobs with controllable processing times as an optimal control problem (Q3312009) (← links)
- Single CNC machine scheduling with controllable processing times and multiple due dates (Q3605428) (← links)
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times (Q4495504) (← links)
- Single-machine batch scheduling problem with job rejection and resource dependent processing times (Q4553872) (← links)
- Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption (Q4909020) (← links)
- A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906) (← links)