Pages that link to "Item:Q1885945"
From MaRDI portal
The following pages link to Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945):
Displayed 9 items.
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times (Q878582) (← links)
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival (Q991390) (← links)
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times (Q5444602) (← links)