The following pages link to Scheduling a batching machine (Q1268850):
Displaying 50 items.
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
- Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
- Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
- Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
- On-line scheduling with delivery time on a single batch machine (Q1022586) (← 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)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
- The complexity of one-machine batching problems (Q1315991) (← links)
- Scheduling with batching: Minimizing the weighted number of tardy jobs (Q1342278) (← links)
- Batching identical jobs (Q1401637) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Scheduling one batch processor subject to job release dates (Q1582073) (← links)
- Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711) (← links)
- A new dynamic look-ahead scheduling procedure for batching machines (Q1600008) (← links)
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost (Q1652653) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- Competitive project scheduling on two unbounded parallel batch machines (Q1656205) (← links)
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Open shop scheduling with synchronization (Q1702656) (← links)
- Co-scheduling algorithms for high-throughput workload execution (Q1702725) (← links)
- MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963) (← links)
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery (Q1723354) (← links)
- Parallel-batch scheduling with two models of deterioration to minimize the makespan (Q1724245) (← links)
- Race to idle or not: balancing the memory sleep time with DVS for energy minimization (Q1743492) (← links)
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← 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 flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971) (← links)
- A PTAS for semiconductor burn-in scheduling (Q1774521) (← links)
- Minimizing makespan with release times on identical parallel batching machines (Q1775064) (← links)
- On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
- Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives (Q1788999) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs (Q1944138) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
- Scheduling a batching machine with convex resource consumption functions (Q1944176) (← links)
- Unbounded parallel-batch scheduling with family jobs and delivery coordination (Q1944952) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
- Batch scheduling with proportional-linear deterioration and outsourcing (Q1992948) (← links)
