Pages that link to "Item:Q1802481"

The following pages link to Two-machine shop scheduling problems with batch processing (Q1802481):

Displaying 26 items.

• Approximation algorithms for two-machine flow shop scheduling with batch setup times (Q1290646) (← links)
• Two-machine flowshop group scheduling problem (Q1577379) (← links)
• Group technology approach to the open shop scheduling problem with batch setup times (Q1577474) (← links)
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
• A comprehensive review of flowshop group scheduling literature (Q1651625) (← links)
• A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528) (← links)
• Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
• The complexity of two group scheduling problems (Q1860372) (← links)
• Scheduling with batching: A review (Q1969826) (← links)
• A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
• Improved MILP models for two-machine flowshop with batch processing machines (Q2389826) (← links)
• Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Open-shop batch scheduling with identical jobs (Q2467272) (← links)
• The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
• Two-machine open shop problem with a single server and set-up time considerations (Q2663040) (← links)
• Batch scheduling on a two-machine jobshop with machine-dependent setup times (Q2892129) (← links)
• On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles (Q4327891) (← links)
• (Q4836303) (← links)
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
• Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
• A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015) (← links)
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)