Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times

J. Fondrevelle; A. Oulamara; M.-C. Portmann

首页> 外文期刊>International journal of production economics >Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times

【24h】

Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times

机译：带时滞的置换Flowshop调度问题，以最大程度减少机器完成时间的加权总和

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

In this article, we consider flowshop scheduling problems with minimal and maximal time lag constraints. Such constraints extend precedence constraints between operations in the jobs and may be used to model various industrial applications. The objective

机译：在本文中，我们考虑具有最小和最大时间滞后约束的Flowshop调度问题。这样的约束扩展了作业中的操作之间的优先约束，并且可以用于对各种工业应用进行建模。目标

著录项

来源
《International journal of production economics》 |2008年第1期|p.168-176|共9页
作者
J. Fondrevelle; A. Oulamara; M.-C. Portmann;
展开▼
作者单位

MACSI Team, LORI A INRIA Lorraine, INPI, F-54042 Nancy. France;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类工业技术;
关键词
flowshop; weighted sum of machine completion times; idle time; minimal and maximal time lags; branch-and-bound procedure;

机译：Flowshop;机器完成时间的加权总和;空闲时间;最小和最大时间延迟;分支定界过程;

相似文献

外文文献
中文文献
专利

1. Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times [J] . T.C.E. Cheng, B.M.T. Lin, Y. Tian Computers & operations research . 2009,第11期

机译：安排一个两阶段的差分流水车间，以最大程度地减少机器完成时间的加权总和
2. Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints [J] . Emna Dhouib, Jacques Teghem, Ta?cir Loukil Journal of mathematical modelling and alogrithms . 2013,第1期

机译：在具有设置时间和时滞约束的置换Flowshop调度问题中，最小化迟到的作业数量
3. Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints [J] . Emna Dhouib, Jacques Teghem, Taïcir Loukil Journal of Mathematical Modelling and Algorithms . 2013,第1期

机译：在具有设置时间和时滞约束的置换Flowshop调度问题中，最小化迟到的作业数量
4. A GA-based heuristic algorithm for non-permutation two-machine robotic flow-shop scheduling problem of minimizing total weighted completion time [C] . The IEEE International Conference on Industrial Engineering and Engineering Management . 2010

机译：基于遗传算法的启发式算法，用于最小化总加权完成时间的非置换两机机器人流水车间调度问题
5. Batch scheduling of two-machine limited-buffer flowshop with setup and removal times. [D] . Dai, Jianbin. 2003

机译：具有设置和删除时间的两机受限缓冲区流水车间的批量调度。
6. Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents [O] . Wen-Chiung Lee, Yau-Ren Shiau, Yu-Hsiang Chung, -1

机译：具有两个竞争代理的单机调度可最大程度地减少总完成时间和拖延时间
7. Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times [O] . Cheng TCE, Lin BMT, Tian Y 2009

机译：安排一个两阶段的差分流水车间，以最大程度地减少机器完成时间的加权总和
8. Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of SpecialCases [R] . Hoogeveen, J. A., Kawaguchi, T. 1996

机译：最小化双机Flowshop的总完工时间：特殊情况分析

Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times

摘要

著录项

相似文献

相关主题

期刊订阅