Manop Reodecha

• Chulalongkorn University

Slides of a related talk at the EURO conference in Reykjavik / Iceland in July 2006

This paper considers a flexible flow shop scheduling problem, where at least one production stage is made up of unrelated parallel machines. Moreover, sequence- and machine-dependent setup times are given. The objective is to find a schedule that minimizes a convex sum of makespan and the number of tardy jobs in a static flexible flow shop environm...

This research develops a memetic algorithm to solve Printed Circuit Board (PCB) scheduling with sequence-dependent setup times on a single machine with constrained feeder capacity. The objective of the scheduling problem is to minimize the total weighted tardiness. A memetic algorithm-based heuristics is developed by integrating a genetic algorithm...

inventory control game is a computer game that is developed for enhancing the comprehension and the skills of those who are learning or working in fields related to inventory control through simulated scenarios. The contents are divided into learning units of specific issues for the purpose of a clear-cut understanding, starting from basic to diffi...

Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria In textile industries, production facilities are established as multi-stage production flow shop facilities where a production stage may be made up of parallel machines. It is known as flexible or hybrid flow shop environment. This paper cons...

A flexible flow shop problem can be considered as a generalization of a pure flow shop problem in which the jobs have to go through the stages in the same order. We consider a flexible flow shop problem with unrelated machines and setup times, where the processing times depend on the chosen machine and setup times are sequence-dependent. While for...

A flexible flow shop problem can be considered as a generalization of a pure flow shop problem in which the jobs have to go through the stages in the same order. We consider a flexible flow shop problem with unrelated machines and setup times, where the processing times depend on the chosen machine and setup times are sequence-dependent. While for...

This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively...

This paper investigates scheduling heuristics to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a hybrid flow shop envi-ronment where at least one production stage is made up of unrelated parallel machines. Se-quence-and machine-dependent setup times are considered. The problem is a combinatorial op...

Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and hence heuristics are used to obtain good solutions in a reasonable time. The specific goal of this paper is to investigate scheduling heuristics, to seek the minimum of a positively weighted convex sum of makespan, and the number of...

This paper presents an investigation of scheduling procedures to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop scheduling environment. The flexible flow shop problem is a scheduling of jobs in a flow shop environment consisting of series of production stages, some of whi...

The goal of this paper is to investigate scheduling heuristics to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static hybrid flow shop environment where at least one production stage is made up of unrelated parallel machines. In addition, sequence -and machine -dependent setup times are consider...

Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and hence heuristics are used to obtain good solutions in reasonable times. The specific goal of this paper is to investigate scheduling heuristics to seek the minimum of a positively weighted convex sum of makespan and the number of tar...

Abstract This paper considers a flexible flow shop scheduling problem, where at least one production stage is made up of unrelated parallel machines. Moreover, sequence- and machine- dependent setup times are given. The objective is to find a schedule that minimizes a positively weighted convex sum of makespan and the number,of tardy jobs in a stat...

This study presents neural network techniques for forecasting the value of new issued banknotes. It employs a backpropagation technique to make forecasts during 1993-1996 using the data from the preceding 12-15 years. It is found that the backpropagation technique provides forecasted results closest to the actual figures with the following paramete...