Pages that link to "Item:Q1969826"
From MaRDI portal
The following pages link to Scheduling with batching: A review (Q1969826):
Displayed 50 items.
- A single machine batch scheduling problem with bounded batch size (Q2467253) (← links)
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times (Q2467255) (← links)
- Open-shop batch scheduling with identical jobs (Q2467272) (← links)
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
- A queueing model for a two-stage stochastic manufacturing system with overlapping operations (Q2475626) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- A bi-objective coordination setup problem in a two-stage production system (Q2482750) (← links)
- Batch scheduling of deteriorating reworkables (Q2482803) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (Q2486757) (← links)
- Minimizing flow-time on a single machine with integer batch sizes (Q2488201) (← links)
- Batch scheduling in a two-level supply chain -- a focus on the supplier (Q2491787) (← links)
- A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups (Q2496029) (← links)
- Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups (Q2565776) (← links)
- Two-machine shop scheduling: Compromise between flexibility and makespan value (Q2566711) (← links)
- Flowshop scheduling research after five decades (Q2572844) (← links)
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2574421) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- Two faster algorithms for coordination of production and batch delivery: a note (Q2629739) (← links)
- A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups (Q2642312) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← links)
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems (Q2655646) (← links)
- Machine scheduling with job class setup and delivery considerations (Q2655964) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
- Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics (Q2669512) (← links)
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
- Analysis of a discrete production workstation (Q2669637) (← links)
- Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- Single machine batch scheduling with non-increasing time slot costs (Q2673533) (← links)
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost (Q2680241) (← links)
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) (← links)
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
- On Minimizing Total Tardiness in a Serial Batching Problem (Q2765603) (← links)
- (Q2861568) (← links)
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries (Q2867109) (← links)
- Scheduling on parallel machines to minimise maximum lateness for the customer order problem (Q2873094) (← links)
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices (Q2954338) (← links)
- No-Wait Scheduling Problems with Batching Machines (Q2958672) (← links)
- A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production (Q2967577) (← links)
- Batch-size-based rearrangement of the shop floor into mini-lines (Q2967580) (← links)
- Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
- Manufacturing process analysis with support of workflow modelling and simulation (Q3055656) (← links)
- TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS (Q3069763) (← links)
- SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)