Pages that link to "Item:Q1077325"

The following pages link to Efficient scheduling algorithms for a single batch processing machine (Q1077325):

Displaying 50 items.

• A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
• Integrated production and delivery on parallel batching machines (Q320081) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
• A two stage scheduling with transportation and batching (Q456105) (← links)
• A model for minimizing active processor time (Q487001) (← links)
• Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
• Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
• Controlling job arrivals with processing time windows into batch processor buffer (Q763114) (← links)
• Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
• Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
• Bicriterion scheduling with equal processing times on a batch processing machine (Q947947) (← links)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
• Scheduling jobs with release dates on parallel batch processing machines (Q1026144) (← links)
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
• Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
• Composing batches with yield uncertainty (Q1261341) (← links)
• Scheduling with agreeable release times and due dates on a batch processing machine (Q1278533) (← links)
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals (Q1348547) (← links)
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing (Q1579492) (← links)
• Scheduling one batch processor subject to job release dates (Q1582073) (← links)
• A new dynamic look-ahead scheduling procedure for batching machines (Q1600008) (← links)
• A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost (Q1652653) (← links)
• Co-scheduling algorithms for high-throughput workload execution (Q1702725) (← links)
• Scheduling batch processing machine using max-min ant system algorithm improved by a local search method (Q1720742) (← links)
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
• Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
• On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
• Minimizing due date related performance measures on two batch processing machines (Q1873010) (← links)
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
• A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
• Unbounded parallel-batch scheduling with family jobs and delivery coordination (Q1944952) (← links)
• Earliness and tardiness scheduling problems on a batch processor (Q1961238) (← links)
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines (Q1969905) (← links)
• Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
• Revisit of the scheduling problems with integrated production and delivery on parallel batching machines (Q2039677) (← links)
• Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Mixed batch scheduling on identical machines (Q2197328) (← links)
• A bi-criteria optimization model for medical device sterilization (Q2212292) (← links)
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
• Minimizing total completion time on a batch processing machine with job families (Q2367392) (← links)
• Realistic two-stage flowshop batch scheduling problems with transportation capacity and times (Q2428924) (← links)
• MIP formulations and heuristics for solving parallel batching problems (Q2429916) (← links)