Pages that link to "Item:Q1652207"
From MaRDI portal
The following pages link to Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207):
Displaying 9 items.
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
- Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date (Q4634328) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- A hybrid neural network approach to minimize total completion time on a single batch processing machine (Q6092620) (← links)
- Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)
