Pages that link to "Item:Q749439"
From MaRDI portal
The following pages link to Batch sizing and job sequencing on a single machine (Q749439):
Displaying 50 items.
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- Optimal single machine scheduling of products with components and changeover cost (Q297186) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- On-line machine scheduling with batch setups (Q604758) (← links)
- Batching decisions for assembly production systems (Q703918) (← links)
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
- Single machine batch scheduling with release times (Q732326) (← links)
- Batch sizing and just-in-time scheduling with common due date (Q744646) (← links)
- Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
- Optimally competitive list batching (Q837154) (← links)
- Batch delivery scheduling with batch delivery cost on a single machine (Q852935) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
- Single machine scheduling with batch deliveries (Q1278307) (← links)
- Scheduling with agreeable release times and due dates on a batch processing machine (Q1278533) (← links)
- The complexity of one-machine batching problems (Q1315991) (← links)
- One-machine batching and sequencing of multiple-type items (Q1332828) (← links)
- Scheduling with batching: Minimizing the weighted number of tardy jobs (Q1342278) (← links)
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926) (← links)
- Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints (Q1612004) (← links)
- Triangle structure diagrams for a single machine batching problem with identical jobs (Q1620666) (← links)
- Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
- A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times (Q1762129) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
- Efficient algorithms for some path partitioning problems (Q1900138) (← links)
- An \(M/G/1\) queue with cyclic service times (Q1919826) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Scheduling the production of two-component jobs on a single machine (Q1969827) (← links)
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745) (← links)
- The multi-stage multi-product batch-sizing problem in the steel industry (Q2287574) (← links)
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs (Q2370330) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A note on special optimal batching structures to minimize total weighted completion time (Q2426655) (← links)
- Integrated batch sizing and scheduling on a single machine (Q2434256) (← links)
- Batch scheduling in a two-level supply chain -- a focus on the supplier (Q2491787) (← links)
- Batch scheduling and common due-date assignment on a single machine (Q2563922) (← links)
- Single machine batch scheduling with non-increasing time slot costs (Q2673533) (← links)
- On Minimizing Total Tardiness in a Serial Batching Problem (Q2765603) (← links)
- No-Wait Scheduling Problems with Batching Machines (Q2958672) (← links)
- Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
