Pages that link to "Item:Q4274645"

The following pages link to Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem (Q4274645):

Displaying 50 items.

• Minimizing the total completion time in a distributed two stage assembly system with setup times (Q337027) (← links)
• Minimizing makespan in three-machine flow shops with deteriorating jobs (Q340257) (← links)
• The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis (Q483213) (← links)
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (Q596459) (← links)
• Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop (Q602916) (← links)
• Batching decisions for assembly production systems (Q703918) (← links)
• Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times (Q706971) (← links)
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
• A note on the complexity of the concurrent open shop problem (Q880556) (← links)
• A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines (Q881563) (← links)
• Minimizing customer order lead-time in a two-stage assembly supply chain (Q940914) (← links)
• The production scheduling problem in a multi-page invoice printing system (Q976049) (← links)
• Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan (Q1010280) (← links)
• The two-stage assembly scheduling problem to minimize total completion time with setup times (Q1017445) (← links)
• Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
• A branch and bound algorithm for the two-stage assembly scheduling problem (Q1280185) (← links)
• Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan (Q1296660) (← links)
• Minimizing makespan in hybrid flowshops (Q1342286) (← links)
• Two-stage flowshop scheduling with a common second-stage machine (Q1373162) (← links)
• Two-stage no-wait scheduling models with setup and removal times separated (Q1374028) (← links)
• Concurrent flowshop scheduling to minimize makespan. (Q1429959) (← links)
• A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints (Q1572969) (← links)
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546) (← links)
• An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
• Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility (Q1698061) (← links)
• Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms (Q1721321) (← links)
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect (Q1727266) (← links)
• Two-machine flowshop scheduling in a physical examination center (Q1740429) (← links)
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness (Q1793450) (← links)
• A note on minimum makespan assembly plans (Q1848367) (← links)
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling (Q1869668) (← links)
• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem (Q1869904) (← links)
• Scheduling for two-stage production system with setup and assembly operations (Q1879793) (← links)
• A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations (Q1991311) (← links)
• A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop (Q2004254) (← links)
• Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems (Q2147094) (← links)
• Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect (Q2152905) (← links)
• Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs (Q2257346) (← links)
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times (Q2293429) (← links)
• Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
• A data intensive heuristic approach to the two-stage streaming scheduling problem (Q2402350) (← links)
• Flow-shop scheduling with setup and assembly operations (Q2467263) (← links)
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application (Q2571194) (← links)
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time (Q2629637) (← links)
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
• Makespan minimization on three-machine flow shop with deteriorating jobs (Q2873830) (← links)
• Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
• TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS (Q3069763) (← links)