Scheduling a batching machine
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Single machine parallel-batch scheduling with deteriorating jobs
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- On-line scheduling with delivery time on a single batch machine
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Scheduling jobs with release dates on parallel batch processing machines
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- The complexity of one-machine batching problems
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Batching identical jobs
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Scheduling one batch processor subject to job release dates
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
- A new dynamic look-ahead scheduling procedure for batching machines
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- Competitive project scheduling on two unbounded parallel batch machines
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Open shop scheduling with synchronization
- Co-scheduling algorithms for high-throughput workload execution
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
- Parallel-batch scheduling with two models of deterioration to minimize the makespan
- Race to idle or not: balancing the memory sleep time with DVS for energy minimization
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- A PTAS for semiconductor burn-in scheduling
- Minimizing makespan with release times on identical parallel batching machines
- On-line scheduling algorithms for a batch machine with finite capacity
- Bi-objective scheduling on a restricted batching machine
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- On scheduling an unbounded batch machine
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Scheduling a batching machine with convex resource consumption functions
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Scheduling with batching: A review
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Batch scheduling with proportional-linear deterioration and outsourcing
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
- Single machine batch scheduling with two non-disjoint agents and splitable jobs
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
- Batch scheduling of nonidentical job sizes with minsum criteria
- A survey of scheduling with parallel batch (p-batch) processing
- On lower and upper bounds for single machine parallel batch scheduling
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Parallel-batch scheduling with deterioration and rejection on a single machine
- Mixed batch scheduling on identical machines
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- The piggyback transportation problem: transporting drones launched from a flying warehouse
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Minimizing the makespan on a single parallel batching machine
- Scheduling parallel batching machines in a sequence
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
- Unbounded parallel-batch scheduling with drop-line tasks
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
- Logic-based Benders decomposition for scheduling a batching machine
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- Single-machine batch scheduling with job processing time compatibility
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Improved MILP models for two-machine flowshop with batch processing machines
- Parallel batch scheduling with nested processing set restrictions
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- A note on special optimal batching structures to minimize total weighted completion time
- Integrated batch sizing and scheduling on a single machine
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- Batch processing with interval graph compatibilities between tasks
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
- Scheduling on a batch processing machine with split compatibility graphs
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- Just-in-time single-batch-processing machine scheduling
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
This page was built for publication: Scheduling a batching machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268850)
