•  Persian
    • Persian
    • English
  •   ورود
  • دانشگاه فردوسی مشهد
  • |
  • مرکز اطلاع‌رسانی و کتابخانه مرکزی
    • Persian
    • English
  • خانه
  • انواع منابع
    • مقاله مجله
    • کتاب الکترونیکی
    • مقاله همایش
    • استاندارد
    • پروتکل
    • پایان‌نامه
  • راهنمای استفاده
View Item 
  •   کتابخانه دیجیتال دانشگاه فردوسی مشهد
  • Fum
  • Articles
  • ProfDoc
  • View Item
  •   کتابخانه دیجیتال دانشگاه فردوسی مشهد
  • Fum
  • Articles
  • ProfDoc
  • View Item
  • همه
  • عنوان
  • نویسنده
  • سال
  • ناشر
  • موضوع
  • عنوان ناشر
  • ISSN
  • شناسه الکترونیک
  • شابک
جستجوی پیشرفته
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

نویسنده:
فرهاد کلاهان
,
M. Liang
,
Farhad Kolahan
سال
: 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.
یو آر آی: http://libsearch.um.ac.ir:80/fum/handle/fum/3376884
کلیدواژه(گان): JIT Sequencing,Tabu search,Heuristic
کالکشن :
  • ProfDoc
  • نمایش متادیتا پنهان کردن متادیتا
  • آمار بازدید

    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 urihttp://libsearch.um.ac.ir:80/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
  • درباره ما
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace