Scheduling in flowshops to minimize total tardiness of jobs

SAMEER HASIJA; CHANDRASEKHARAN RAJENDRAN

首页> 外文期刊>International Journal of Production Research >Scheduling in flowshops to minimize total tardiness of jobs

【24h】

Scheduling in flowshops to minimize total tardiness of jobs

机译：在流水车间进行调度以最大程度地减少工作的拖延

获取原文

获取原文并翻译 | 示例

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

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

The problem of scheduling in static flowshops is considered with the objective of minimizing mean or total tardiness of jobs. A heuristic algorithm based on the simulated annealing (SA) technique is developed. The salient features of the proposed SA algorithm are the development of two new perturbation schemes for use in the proposed SA algorithm and a new improvement scheme to improve the quality of the solutions. The proposed algorithm is evaluated by using the benchmark problems available in the literature. The performance of the proposed SA algorithm is found to be very good, and the proposed heuristic performs better than the existing heuristics.

机译：考虑将静态流水车间中的调度问题视为目标，以最大程度地减少作业的平均或总体延迟。提出了一种基于模拟退火算法的启发式算法。提出的SA算法的显着特征是，开发了两种用于提出的SA算法的新的扰动方案，以及一种新的改进方案，以提高解的质量。通过使用文献中存在的基准问题对提出的算法进行评估。发现所提出的SA算法的性能非常好，并且所提出的启发式算法比现有的启发式算法表现更好。

著录项

来源
《International Journal of Production Research》 |2004年第11期|p.2289-2301|共13页
作者
SAMEER HASIJA; CHANDRASEKHARAN RAJENDRAN;
展开▼
作者单位

Industrial Engineering and Management Division, Department of Humanities and Social Sciences, Indian Institute of Technology Madras, Chennai - 600036, India;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类管理学;
关键词

相似文献

外文文献
中文文献
专利

1. An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption [J] . Damla Yueksel, M. Fatih Tasgetiren, Levent Kandiller, Computers & Industrial Engineering . 2020,第Jula期

机译：节能双目标无等待置换流程调度问题，以最大限度地减少总迟到和总能耗
2. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [J] . Birgin E. G., Ferreira J. E., Ronconi D. P. Computers & operations research . 2020,第Feba期

机译：一种用于m机排列流水车间调度问题的过滤波束搜索方法，可最大程度地减少工作的提前性和拖延时间以及等待时间
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 alogrithms . 2013,第1期

机译：在具有设置时间和时滞约束的置换Flowshop调度问题中，最小化迟到的作业数量
4. SCHEDULING GROUPS OF JOBS IN A PERMUTATION FLOWSHOP TO MINIMIZE TOTAL EARLINESS AND TARDINESS [C] . Jeffrey E. Schaller, Jorge M. S. Valente Decision Sciences Institute annual meeting . 2012

机译：排定调度流程中的作业组以最小化总提前期和延期
5. Using GRASP to Minimize the Number of Tardy Jobs in a Two-Stage Flowshop With Batch Processing Machines. [D] . Screnock, Joshua. 2017

机译：在具有批处理机器的两阶段Flowshop中，使用GRASP最大限度地减少迟到的作业数量。
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. Trajectory Scheduling Methods for minimizing total tardiness in a flowshop [O] . Xiaoping Li, Long Chen, Haiyan Xu, 2015

机译：用于最小化流水车间总延迟的轨迹调度方法

Scheduling in flowshops to minimize total tardiness of jobs

摘要

著录项

相似文献

相关主题

期刊订阅