A Single Machine Sequencing Problem With Variable Machining Times And Sequence- Dependent Setups
سال
: 1996
چکیده: This paper addresses the just-in-time (JIT) sequencing problem on a single machine with variable machining times and sequence-dependent setups. The objective is to find the best trade-off between the JIT goal and the machining time compression and extension costs. A tabu search approach is proposed to provide good and quick solutions. The performance of the proposed approach is demonstrated using an example.
کلیدواژه(گان): JIT Sequencing,Tabu search,Heuristic
کالکشن
:
-
آمار بازدید
A Single Machine Sequencing Problem With Variable Machining Times And Sequence- Dependent Setups
Show full item record
contributor author | فرهاد کلاهان | en |
contributor author | M. Liang | en |
contributor author | Farhad Kolahan | fa |
date accessioned | 2020-06-06T13:58:10Z | |
date available | 2020-06-06T13:58:10Z | |
date copyright | 8/8/1996 | |
date issued | 1996 | |
identifier uri | https://libsearch.um.ac.ir:443/fum/handle/fum/3376884 | |
description abstract | This paper addresses the just-in-time (JIT) sequencing problem on a single machine with variable machining times and sequence-dependent setups. The objective is to find the best trade-off between the JIT goal and the machining time compression and extension costs. A tabu search approach is proposed to provide good and quick solutions. The performance of the proposed approach is demonstrated using an example. | en |
language | English | |
title | A Single Machine Sequencing Problem With Variable Machining Times And Sequence- Dependent Setups | en |
type | Conference Paper | |
contenttype | External Fulltext | |
subject keywords | JIT Sequencing | en |
subject keywords | Tabu search | en |
subject keywords | Heuristic | en |
identifier link | https://profdoc.um.ac.ir/paper-abstract-1016782.html | |
conference title | 5th Industrial Engineering Research Conference Proceedings | en |
conference location | میامی | fa |
identifier articleid | 1016782 |