Scheduling a batching machine
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A PTAS for semiconductor burn-in scheduling
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
- A note on unbounded parallel-batch scheduling
- Batch machine production with perishability time windows and limited batch size
- Scheduling parallel batching machines in a sequence
- scientific article; zbMATH DE number 2119735 (Why is no real title available?)
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- Scheduling an unbounded batching machine with job processing time compatibilities
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- On minimizing total tardiness in a serial batching problem
- scientific article; zbMATH DE number 67596 (Why is no real title available?)
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
- On the Maximum Edge Coloring Problem
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
- Scheduling a proportionate flow shop of batching machines
- Unbounded batch scheduling with a common due window on a single machine
- Single-machine batch scheduling with job processing time compatibility
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- Scheduling batches with simultaneous job processing for two-machine shop problems
- Makespan minimization in a no-wait flow shop problem with two batching machines
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Flowshop scheduling problem with a batching machine and task compatibilities
- A note on special optimal batching structures to minimize total weighted completion time
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
- Scheduling on a batch processing machine with split compatibility graphs
- Parallel-batch scheduling with deterioration and rejection on a single machine
- scientific article; zbMATH DE number 1082109 (Why is no real title available?)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Batching machine scheduling with bicriteria: maximum cost and makespan
- Open shop scheduling with synchronization
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Scheduling jobs with release dates on parallel batch processing machines
- Optimally competitive list batching
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses
- Two problems about single machine parallel batching with batching costs
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Mixed batch scheduling on identical machines
- Algorithms for two kinds of parallel batch scheduling with batching costs
- Minimizing total completion time on a batching machine with job processing time compatibilities
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- Parallel batch scheduling with nested processing set restrictions
- 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
- Batch scheduling of nonidentical job sizes with minsum criteria
- Just-in-time single-batch-processing machine scheduling
- Hierarchical optimization on an unbounded parallel-batching machine
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Parallel-batch scheduling with two models of deterioration to minimize the makespan
- A survey of scheduling with parallel batch (p-batch) processing
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
- Competitive project scheduling on two unbounded parallel batch machines
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Unbounded parallel-batch scheduling with drop-line tasks
- Theory and Applications of Models of Computation
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- The piggyback transportation problem: transporting drones launched from a flying warehouse
- Scheduling a Flexible Batching Machine
- A batching scheduling algorithm for maximizing total weighed number of jobs completed in due data window
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- A new dynamic look-ahead scheduling procedure for batching machines
- Exact approaches for single machine total weighted tardiness batch scheduling
- Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
- Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
- Scheduling a batching machine with convex resource consumption functions
- No-wait scheduling problems with batching machines
- Race to idle or not: balancing the memory sleep time with DVS for energy minimization
- Optimal batching structures of scheduling problems with fix batch number
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
- Logic-based Benders decomposition for scheduling a batching machine
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- Bi-objective scheduling on a restricted batching machine
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Co-scheduling algorithms for high-throughput workload execution
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)
