Makespan Minimization for Flow-Shop Problems With Transportation Times and a Single Robot

Discrete Applied Mathematics- Netherlands

doi 10.1016/s0166-218x(00)00316-4

Full Text

Abstract

Available in

Categories

Applied Mathematics

Discrete Mathematics

Date

September 1, 2001

Authors

Publisher

Elsevier BV

Related search

Flow Shop Scheduling Problem With Four Machines N-Job for Minimizing Makespan

International Journal of Engineering Research and

English

A Review of Lot Streaming in a Flow Shop Environment With Makespan Criteria

Journal of Industrial Engineering and Management

Manufacturing Engineering

English

Optimization of Scheduling in Job Shop Through Minimization of Makespan Using Cpso and Ga

International journal of Latest Trends in Engineering & Technology

English

Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems With Makespan Criterion

International Journal of Swarm Intelligence Research

Computational Theory

Computer Science Applications

Artificial Intelligence

English

Penerapan Algoritma Simulated Annealing Untuk Meminimasi Makespan Pada Penjadwalan Flow Shop

Journal Industrial Servicess

Indonesian

Flexible Flow Shop Scheduling With Stochastic Processing Times: A Decomposition-Based Approach

Computers and Industrial Engineering

Computer Science

English

Bi-Objective Scheduling for Re-Entrant Hybrid Flow Shop With Learning Effect and Setup Times

Scientia Iranica

English

Minimum Makespan Scheduling With Low Rank Processing Times

English

A New Combined Approach for Optimizing Makespan in Job Shop Scheduling Problem

International Journal of Innovative Research in Science, Engineering and Technology

English