Scheduling a batching machine
From MaRDI portal
Publication:1268850
DOI<31::AID-JOS4>3.0.CO;2-R 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-RzbMath0909.90172MaRDI QIDQ1268850
Andrei Gladky, Peter Brucker, Steef L. van de Velde, Mikhail Y. Kovalyov, Thomas Tautenhahn, Chris N. Potts, Hoogeveen, J. A.
Publication date: 11 January 1999
Published in: Journal of Scheduling (Search for Journal in Brave)
dynamic programmingbatching machinejob completion timestotal weighted tardinessweighted number of tardy jobs
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Minimizing the weighted number of tardy jobs on multiple machines: a review, One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective, Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times, Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost, Improved MILP models for two-machine flowshop with batch processing machines, Integrated scheduling problem on a single bounded batch machine with an unavailability constraint, BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN, A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES, Parallel batch scheduling with nested processing set restrictions, Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan, Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling, Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives, Hierarchical optimization on an unbounded parallel-batching machine, Just-in-time single-batch-processing machine scheduling, Exact algorithms to minimize makespan on single and parallel batch processing machines, Exact methods for the oven scheduling problem, Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost, Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems, Parallel-batch scheduling with rejection: structural properties and approximation algorithms, Approximation algorithms for batch scheduling with processing set restrictions, No-Wait Scheduling Problems with Batching Machines, Parallel-batch scheduling with deterioration and rejection on a single machine, A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing, Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components, Single machine unbounded parallel-batch scheduling with forbidden intervals, A note on special optimal batching structures to minimize total weighted completion time, Mixed batch scheduling on identical machines, Scheduling jobs with sizes and delivery times on identical parallel batch machines, 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, A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions, Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan, Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection, An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan, Minimizing makespan on a single batch processing machine with nonidentical job sizes, The piggyback transportation problem: transporting drones launched from a flying warehouse, Batch processing with interval graph compatibilities between tasks, A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING, ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING, On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan, Scheduling batches with simultaneous job processing for two-machine shop problems, On Minimizing Total Tardiness in a Serial Batching Problem, Minimizing makespan on a single batching machine with release times and non-identical job sizes, Unnamed Item, Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan, Minimizing the makespan on a single parallel batching machine, On the Maximum Edge Coloring Problem, Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times, Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure, Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity, Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness, SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION, Scheduling a proportionate flow shop of batching machines, Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop, Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times, Batch scheduling of nonidentical job sizes with minsum criteria, Unbounded parallel-batch scheduling with drop-line tasks, THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE, Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes, Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan, A survey of scheduling with parallel batch (p-batch) processing, Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs, MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES, Logic-based Benders decomposition for scheduling a batching machine, On lower and upper bounds for single machine parallel batch scheduling, A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes, 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, Single-machine batch scheduling with job processing time compatibility, Scheduling on a batch processing machine with split compatibility graphs, Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries, Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times, Scheduling a single machine with parallel batching to minimize makespan and total rejection cost, Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine, On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs, Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness, Optimally competitive list batching, A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes, A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times, A best possible on-line algorithm for scheduling on uniform parallel-batch machines, Integrated production and delivery on parallel batching machines, The lockmaster's problem, Makespan minimization in a no-wait flow shop problem with two batching 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, Scheduling parallel-machine batch operations to maximize on-time delivery performance, Split-merge: using exponential neighborhood search for scheduling a batching machine, Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom, Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing, Online scheduling on bounded batch machines to minimize the maximum weighted completion time, Competitive project scheduling on two unbounded parallel batch machines, The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan, A survey of single machine scheduling to minimize weighted number of tardy jobs, Batch scheduling with deteriorating jobs to minimize the total 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, A constraint programming approach for a batch processing problem with non-identical job sizes, Unbounded batch scheduling with a common due window on a single machine, On the max-weight edge coloring problem, Optimal on-line algorithms for one batch machine with grouped processing times, Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities, 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, Batch machine production with perishability time windows and limited batch size, Unbounded parallel-batch scheduling with family jobs and delivery coordination, On the complexity of bi-criteria scheduling on a single batch processing machine, Open shop scheduling with synchronization, Co-scheduling algorithms for high-throughput workload execution, Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs, Bi-criteria scheduling on a single parallel-batch machine, A two stage scheduling with transportation and batching, On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems., The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan, The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan, 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, 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, Scheduling with batching: A review, Online over time scheduling on parallel-batch machines: a survey, Scheduling a bounded parallel-batching machine with incompatible job families and rejection, A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, A note on unbounded parallel-batch scheduling, Race to idle or not: balancing the memory sleep time with DVS for energy minimization, Bicriterion scheduling with equal processing times on a batch processing machine, A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan, Flowshop scheduling problem with a batching machine and task compatibilities, Batch scheduling with proportional-linear deterioration and outsourcing, A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints, An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines, Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, On the max coloring problem, Scheduling of deteriorating jobs with release dates to minimize the maximum lateness, Online scheduling on unbounded parallel-batch machines with incompatible job families, Best semi-online algorithms for unbounded parallel batch scheduling, Integrated problem of soaking pit heating and hot rolling scheduling in steel plants, The coordination of transportation and batching scheduling, A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals, Optimal methods for batch processing problem with makespan and maximum lateness objectives, Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan, Batching decisions for assembly production systems, Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times, Minimizing number of tardy jobs on a batch processing machine with incompatible job families, 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, Single machine batch scheduling with two non-disjoint agents and splitable jobs, A DP algorithm for minimizing makespan and total completion time on a series-batching machine, On-line scheduling algorithms for a batch machine with finite capacity, Bi-objective scheduling on a restricted batching machine, Online scheduling on unbounded parallel-batch machines to minimize the makespan, A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives, Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan, Scheduling hybrid flowshop with parallel batching machines and compatibilities, Revisit of the scheduling problems with integrated production and delivery on parallel batching machines, 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, Scheduling an unbounded batching machine with job processing time compatibilities, Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead, 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, On scheduling an unbounded batch machine
