•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • ProfDoc
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • ProfDoc
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Single Machine Sequencing Problem With Variable Machining Times And Sequence- Dependent Setups

Author:
فرهاد کلاهان
,
M. Liang
,
Farhad Kolahan
Year
: 1996
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.
URI: https://libsearch.um.ac.ir:443/fum/handle/fum/3376884
Keyword(s): JIT Sequencing,Tabu search,Heuristic
Collections :
  • ProfDoc
  • Show Full MetaData Hide Full MetaData
  • Statistics

    A Single Machine Sequencing Problem With Variable Machining Times And Sequence- Dependent Setups

Show full item record

contributor authorفرهاد کلاهانen
contributor authorM. Liangen
contributor authorFarhad Kolahanfa
date accessioned2020-06-06T13:58:10Z
date available2020-06-06T13:58:10Z
date copyright8/8/1996
date issued1996
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/3376884
description abstractThis 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
languageEnglish
titleA Single Machine Sequencing Problem With Variable Machining Times And Sequence- Dependent Setupsen
typeConference Paper
contenttypeExternal Fulltext
subject keywordsJIT Sequencingen
subject keywordsTabu searchen
subject keywordsHeuristicen
identifier linkhttps://profdoc.um.ac.ir/paper-abstract-1016782.html
conference title5th Industrial Engineering Research Conference Proceedingsen
conference locationمیامیfa
identifier articleid1016782
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace