Pages that link to "Item:Q1969826"
From MaRDI portal
The following pages link to Scheduling with batching: A review (Q1969826):
Displaying 50 items.
- 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)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date (Q812435) (← 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)
- Batch scheduling of step deteriorating jobs (Q835578) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- A hybrid two-stage transportation and batch scheduling problem (Q838180) (← links)
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
- Single machine scheduling with batch-dependent setup times (Q844160) (← links)
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
- Makespan minimization in a no-wait flow shop problem with two batching machines (Q856680) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- Scheduling a hybrid flowshop with batch production at the last stage (Q875417) (← links)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan (Q880565) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Single processor scheduling with job values depending on their completion times (Q880588) (← links)
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
- Batching deteriorating items with applications in computer communication and reverse logistics (Q884021) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
- Scheduling with returnable containers (Q906554) (← links)
- Group sequencing around a common due date (Q937402) (← links)
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
- Fuzzy job shop scheduling with lot-sizing (Q940894) (← links)
- Scheduling at coal handling facilities using simulated annealing (Q953296) (← links)
- Minimizing makespan for multi-spindle head machines with a mobile table (Q954031) (← 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)
- Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines (Q962838) (← links)
- The coordination of transportation and batching scheduling (Q965544) (← links)
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival (Q991390) (← links)
- Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- Scheduling reentrant jobs on parallel machines with a remote server (Q1010265) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329) (← links)
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
- Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
- Scheduling incompatible tasks on two machines (Q1042485) (← links)
- On-line integrated production-distribution scheduling problems with capacitated deliveries (Q1042489) (← links)
- Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← links)
