Scheduling a batching machine
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Integrated batch sizing and scheduling on a single machine
- Batch processing with interval graph compatibilities between tasks
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
- Batching machine scheduling with bicriteria: maximum cost and makespan
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Parallel-batch scheduling with two models of deterioration to minimize the makespan
- The coordination mechanism for scheduling game with deterioration jobs and uniform-batch machines
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- scientific article; zbMATH DE number 1082109 (Why is no real title available?)
- 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
- Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
- A new dynamic look-ahead scheduling procedure for batching machines
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Optimally competitive list batching
- Logic-based Benders decomposition for scheduling a batching machine
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Scheduling a Flexible Batching Machine
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- On the max coloring problem
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
- Best semi-online algorithms for unbounded parallel batch scheduling
- A batching scheduling algorithm for maximizing total weighed number of jobs completed in due data window
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Race to idle or not: balancing the memory sleep time with DVS for energy minimization
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Optimal on-line algorithms for one batch machine with grouped processing times
- Two problems about single machine parallel batching with batching costs
- Makespan minimization in a no-wait flow shop problem with two batching machines
- Online over time scheduling on parallel-batch machines: a survey
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
- Scheduling a proportionate flow shop of batching machines
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- No-wait scheduling problems with batching machines
- Scheduling one batch processor subject to job release dates
- On the complexity of bi-criteria scheduling on a single batch processing machine
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
- Exact methods for the oven scheduling problem
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Scheduling with batching: A review
- Improved MILP models for two-machine flowshop with batch processing machines
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- On scheduling an unbounded batch machine
- Batching decisions for assembly production systems
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Submodular batch scheduling on parallel machines
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Exact approaches for single machine total weighted tardiness batch scheduling
- Integrated production and delivery on parallel batching machines
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
- A note on special optimal batching structures to minimize total weighted completion time
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Competitive project scheduling on two unbounded parallel batch machines
- A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing
- A two stage scheduling with transportation and batching
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Scheduling jobs with release dates on parallel batch processing machines
- A PTAS for semiconductor burn-in scheduling
- Optimal batching structures of scheduling problems with fix batch number
- Unbounded batch scheduling with a common due window on a single machine
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Theory and Applications of Models of Computation
- Scheduling parallel batching machines in a sequence
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- The lockmaster's problem
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- scientific article; zbMATH DE number 2119735 (Why is no real title available?)
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)
