Pages that link to "Item:Q2268874"

The following pages link to Minimizing the makespan on a single parallel batching machine (Q2268874):

Displaying 9 items.

• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
• A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
• Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888) (← links)
• Minimizing makespan in batch machine scheduling (Q1882631) (← links)
• Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine (Q2182772) (← links)
• Minimizing makespan on a single batching machine with release times and non-identical job sizes (Q2488218) (← links)
• Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow (Q4632969) (← links)