Pages that link to "Item:Q1969826"
From MaRDI portal
The following pages link to Scheduling with batching: A review (Q1969826):
Displayed 50 items.
- Order consolidation for batch processing (Q1774533) (← links)
- Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← links)
- On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- The complexity of two group scheduling problems (Q1860372) (← links)
- Scheduling parallel dedicated machines under a single non-shared resource (Q1869718) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- Machine scheduling with job delivery coordination (Q1876146) (← links)
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs (Q1887796) (← links)
- Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs (Q1944138) (← links)
- Batch scheduling with proportional-linear deterioration and outsourcing (Q1992948) (← links)
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants (Q2003439) (← links)
- Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry (Q2027046) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- The crop growth planning problem in vertical farming (Q2031116) (← links)
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines (Q2039677) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- Two-agent integrated scheduling of production and distribution operations with fixed departure times (Q2076366) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
- Job scheduling of diffusion furnaces in semiconductor fabrication facilities (Q2140148) (← links)
- A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing (Q2140160) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Lot-size scheduling of a single product on unrelated parallel machines (Q2174901) (← links)
- Grouping tasks to save energy in a cyclic scheduling problem: a complexity study (Q2178065) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- A local search framework for industrial test laboratory scheduling (Q2241157) (← links)
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning (Q2242334) (← links)
- A cyclic approach to large-scale short-term planning in chemical batch production (Q2268519) (← links)
- Minimizing the makespan on a single parallel batching machine (Q2268874) (← links)
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347) (← links)
- Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints (Q2294600) (← links)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines (Q2317137) (← links)
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580) (← links)
- Logic-based Benders decomposition for scheduling a batching machine (Q2333133) (← links)
- Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times (Q2340165) (← links)
- Single-machine batch scheduling of linear deteriorating jobs (Q2344768) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs (Q2370330) (← links)