ON AN OPTIMAL SCHEDULE PROCEDURE FOR SOLVING A N × 2 FLOW-SHOP PROBLEM INVOLVING PROCESSING TIMES, SETUP TIMES AND TRANSPORTATION TIMES ALONGWITH JOB-BLOCKS OF JOBS IN WHICH FIRST JOB IN EACH JOB-BLOCK BEING THE SAME

Anup Maggu; P. L. Maggu

首页> 外文期刊>Pure and Applied Mathematika Sciences >ON AN OPTIMAL SCHEDULE PROCEDURE FOR SOLVING A N × 2 FLOW-SHOP PROBLEM INVOLVING PROCESSING TIMES, SETUP TIMES AND TRANSPORTATION TIMES ALONGWITH JOB-BLOCKS OF JOBS IN WHICH FIRST JOB IN EACH JOB-BLOCK BEING THE SAME

【24h】

ON AN OPTIMAL SCHEDULE PROCEDURE FOR SOLVING A N × 2 FLOW-SHOP PROBLEM INVOLVING PROCESSING TIMES, SETUP TIMES AND TRANSPORTATION TIMES ALONGWITH JOB-BLOCKS OF JOBS IN WHICH FIRST JOB IN EACH JOB-BLOCK BEING THE SAME

机译：关于解决每个作业块中第一个作业相同的作业时间，建立时间和运输时间的N×2流程问题的最佳计划程序

获取原文

获取原文并翻译 | 示例

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

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

This paper attempts to give an optimal schedule procedure for a 'two-machine, n-job' flow-shop production scheduling problem in which processing times, setup times and transportation times for all jobs are separately given and jobs are being completed through the two machines in finite number of job-blocks where the first job is the same job in each job block.

机译：本文尝试针对“两机，n作业”流水车间生产调度问题给出最佳调度程序，其中分别给出了所有作业的处理时间，准备时间和运输时间，并且通过这两个作业来完成作业有限数量的作业块中的机器，其中第一个作业是每个作业块中的相同作业。

著录项

来源
《Pure and Applied Mathematika Sciences》 |2012年第2期|共6页
作者
Anup Maggu; P. L. Maggu;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类计量学;
关键词

相似文献

外文文献
中文文献
专利

1. ON AN OPTIMAL SCHEDULE PROCEDURE FOR SOLVING A N × 2 FLOW-SHOP PROBLEM INVOLVING PROCESSING TIMES, SETUP TIMES AND TRANSPORTATION TIMES ALONGWITH JOB-BLOCKS OF JOBS IN WHICH FIRST JOB IN EACH JOB-BLOCK BEING THE SAME [J] . Anup Maggu, P. L. Maggu Pure and Applied Mathematika Sciences . 2012,第1a2期

机译：关于解决每个作业块中第一个作业相同的作业时间，建立时间和运输时间的N×2流程问题的最佳计划程序
2. ON OPTIMAL TECHNIQUE FOR 2-MACHINE, n-JOB FLOW-SHOP PROBLEM MINIMIZING TOTAL WAITING-TIME FOR JOBS WHEN THE JOBS INVOLVE ARBITRARY TIME LAGS AND EQUIVALENT JOBS FOR JOB-BLOCKS [J] . P. L. Maggu Pure and Applied Mathematika Sciences . 2015,第1a2期

机译：最小化作业涉及任意时间延迟和等效作业的Job的总等待时间的2机n-JOB流量问题的最优技术
3. Optimal Three Stage Flow Shop Scheduling in which Processing Time, Set Up Time, Each Associated With Probabilities Including Transportation Time and Jobs in a String of Disjoint Job-Blocks [J] . Sameer Sharma Journal of Natural Sciences Research . 2011,第3期

机译：最佳三级流水车间调度，其中处理时间，设置时间，每一个都与一系列不连贯的工作块中包括运输时间和工作的概率相关联
4. Optimal strategies for real-time determination of the next job's class in a single machine with setup times and controllable processing times [C] . Aicardi Michele, Giglio Davide, Minciardi Riccardo European Control Conference . 2007

机译：通过设置时间和可控制的处理时间在一台机器上实时确定下一个作业类别的最佳策略
5. Heuristics for scheduling reentrant flexible job shops with sequence-dependent setup times and limited buffer capacities [D] . Kunadilok, Jakrawarn 2007

机译：通过顺序依赖的设置时间和有限的缓冲区容量来安排可重入的灵活作业车间的启发式方法
6. Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines [O] . Guang-Qian Zhang, Jian-Jun Wang, Ya-Jing Liu -1

机译：在不相关的并行机上调度具有可变作业处理时间的作业
7. ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES [O] . Parkash Lal Maggu, Ghanshiam Das, Ravinder Kumar 1981

机译：在运输时间的2×N序列序列中的作业块等效作业

ON AN OPTIMAL SCHEDULE PROCEDURE FOR SOLVING A N × 2 FLOW-SHOP PROBLEM INVOLVING PROCESSING TIMES, SETUP TIMES AND TRANSPORTATION TIMES ALONGWITH JOB-BLOCKS OF JOBS IN WHICH FIRST JOB IN EACH JOB-BLOCK BEING THE SAME

摘要

著录项

相似文献

相关主题

期刊订阅