Pages that link to "Item:Q596087"

The following pages link to The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087):

Displaying 19 items.

• A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
• Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888) (← links)
• Minimizing makespan for multi-spindle head machines with a mobile table (Q954031) (← links)
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
• The coordination of transportation and batching scheduling (Q965544) (← links)
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
• Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
• Unbounded parallel-batch scheduling with family jobs and delivery coordination (Q1944952) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
• Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
• Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) (← links)
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
• Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)