Pages that link to "Item:Q4018528"

The following pages link to Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity (Q4018528):

Displaying 50 items.

• Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
• Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238) (← links)
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
• Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
• Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
• Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
• Discrete-time, economic lot scheduling problem on multiple, non-identical production lines (Q421620) (← links)
• Single-machine group scheduling with general deterioration and learning effects (Q437886) (← links)
• Single machine group scheduling with decreasing time-dependent processing times subject to release dates (Q470781) (← links)
• Unbounded batch scheduling with a common due window on a single machine (Q611087) (← links)
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
• Single machine group scheduling with resource dependent setup and processing times (Q707136) (← 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 group scheduling with time dependent processing times and ready times (Q726558) (← links)
• Batch sizing and just-in-time scheduling with common due date (Q744646) (← links)
• Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
• The coordination of scheduling and batch deliveries (Q816348) (← links)
• Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
• Makespan minimization in a no-wait flow shop problem with two batching machines (Q856680) (← links)
• Scheduling parallel machines for the customer order problem (Q880492) (← links)
• Lot-sizing scheduling with batch setup times (Q880550) (← links)
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
• Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
• Group sequencing around a common due date (Q937402) (← links)
• Fuzzy job shop scheduling with lot-sizing (Q940894) (← links)
• Flowshop scheduling problem with a batching machine and task compatibilities (Q954038) (← links)
• Batching and scheduling in a multi-machine flow shop (Q954247) (← links)
• Production scheduling with supply and delivery considerations to minimize the makespan (Q958556) (← links)
• Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329) (← links)
• Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
• Batching in single operation manufacturing systems (Q1062613) (← links)
• Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (Q1266534) (← links)
• Batch scheduling with deadlines on parallel machines (Q1273116) (← links)
• Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← links)
• Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
• Approximation algorithms for two-machine flow shop scheduling with batch setup times (Q1290646) (← links)
• Optimal streaming of a single job in a two-stage flow shop (Q1303706) (← links)
• Lot streaming in open shops (Q1306390) (← links)
• Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
• Lot streaming in three-stage production processes (Q1331614) (← links)
• Integration of lotsizing and scheduling decisions in a job-shop (Q1331617) (← links)
• Batching and scheduling. Models and methods for several problem classes (Q1347692) (← links)
• Batch scheduling to minimize maximum lateness (Q1373461) (← links)
• Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing (Q1374386) (← links)
• The complexity of scheduling job families about a common due date (Q1376265) (← links)
• Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← links)