Pages that link to "Item:Q1315991"

The following pages link to The complexity of one-machine batching problems (Q1315991):

Displaying 50 items.

• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← 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)
• Single-machine batch scheduling minimizing weighted flow times and delivery costs (Q614457) (← links)
• Monge and feasibility sequences in general flow problems (Q686244) (← links)
• Single machine batch scheduling with release times (Q732326) (← links)
• The coordination of scheduling and batch deliveries (Q816348) (← 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)
• A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← 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 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 comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← 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)
• MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963) (← links)
• Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
• Two-machine flowshop batching and scheduling (Q1772969) (← links)
• On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
• Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← 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)
• Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
• Scheduling with batching: A review (Q1969826) (← links)
• Scheduling the production of two-component jobs on a single machine (Q1969827) (← links)
• Mixed batch scheduling on identical machines (Q2197328) (← links)
• Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← 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)
• A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs (Q2370330) (← 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)
• Logistics scheduling with batching and transportation (Q2482765) (← 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)
• Batch scheduling and common due-date assignment on a single machine (Q2563922) (← 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)