Pages that link to "Item:Q2256319"
From MaRDI portal
The following pages link to A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319):
Displaying 11 items.
- Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation (Q319939) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571) (← links)
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates (Q1652182) (← links)
- Risk measure of job shop scheduling with random machine breakdowns (Q1654341) (← links)
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem (Q1754010) (← links)
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
- A Lagrangian decomposition approach for the pump scheduling problem in water networks (Q2629691) (← links)
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
- Server cloud scheduling (Q6130327) (← links)
