Pages that link to "Item:Q4713573"
From MaRDI portal
The following pages link to Minimizing flow time on a single machine with job classes and setup times (Q4713573):
Displaying 32 items.
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- Single facility scheduling with multiple job classes (Q1105481) (← links)
- Scheduling two job classes on a single machine (Q1186919) (← links)
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time (Q1273118) (← links)
- Single facility scheduling with major and minor setups (Q1373896) (← links)
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time (Q1374439) (← links)
- Minimizing maximum lateness with job families (Q1590808) (← links)
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
- Minimizing flowtime for paired tasks (Q1751895) (← links)
- Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← links)
- Batch scheduling to minimize total completion time (Q1890951) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- An uncertain programming model for single machine scheduling problem with batch delivery (Q2313751) (← links)
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs (Q2370330) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
- Batch scheduling in a two-level supply chain -- a focus on the supplier (Q2491787) (← links)
- Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues (Q2564877) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- Online machine scheduling with family setups (Q2821094) (← links)
- Single machine scheduling to minimize the setup time and the earliness (Q3411902) (← links)
- A New Heuristic for a Single Machine Scheduling Problem with Set-up Times (Q4868837) (← links)
- Minimizing flow time in a flow-line manufacturing cell with family setup times (Q5200787) (← links)
- Minimizing Maximum Flow-time on Related Machines (Q5351891) (← links)
- Minimizing sum of completion times on a single machine with sequence-dependent family setup times (Q5469663) (← links)
- Dynamic programming algorithms for scheduling parallel machines with family setup times (Q5926032) (← links)
- A heuristic approach for single-machine scheduling with due dates and class setups. (Q5945318) (← links)
