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

P. L. Maggu

首页> 外文期刊>Pure and Applied Mathematika Sciences >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

【24h】

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

机译：最小化作业涉及任意时间延迟和等效作业的Job的总等待时间的2机n-JOB流量问题的最优技术

获取原文

获取原文并翻译 | 示例

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

开具论文收录证明 >>

页面导航

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

摘要

This paper gives optimal technique for finding optimal schedule/sequence to minimize total waiting time for all jobs when along with processing times of jobs, jobs involve arbitrary time lags jobs and equivalent for job-blocks.

机译：本文提供了一种最佳技术，用于找到最佳计划/顺序，以使所有作业的总等待时间最小化，同时还要处理作业时间，作业涉及任意时间滞后的作业以及等效的作业块。

著录项

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

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

相似文献

外文文献
中文文献
专利

1. 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流量问题的最优技术
2. 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流程问题的最佳计划程序
3. ON AN OPTIMAL SCHEDULE PROCEDURE FOR 2 × n FLOW-SHOP SCHEDULING PROBLEM INVOLVING PROCESSING TIMES, SETUP TIMES, TRANSPORTA-TION TIMES WITH THEIR RESPECTIVE PROBABILITIES AND AN EQUI-VALENTJOB FOR A JOB-BLOCK [J] . Anup Maggu Pure and Applied Mathematika Sciences . 2013,第1a2期

机译：涉及加工时间，建立时间，运输时间及其相应概率和工作块的等价作业的2×n流程调度问题的最优调度程序
4. Two mixed integer programming formulations on single machine to reschedule repaired jobs for minimizing the total waiting-time [C] . Yandong Guo, Xiaodong Xie Chinese Automation Congress . 2017

机译：单台机器上的两个混合整数编程公式可重新安排已修复的作业，以最大程度地减少总等待时间
5. Minimizing makespan for hybrid flowshops with batch, discrete processing machines and arbitrary job sizes. [D] . Zheng, Yanming. 2011

机译：使用批处理，离散处理机器和任意作业大小的混合流水车间，最小化制造时间。
6. Job Crafting as a Mediator between Work Engagement and Wellbeing Outcomes: A Time-Lagged Study [O] . Enrique Robledo, Salvatore Zappalà, Gabriela Topa 2019

机译：在工作投入与幸福感之间进行调解的工作技巧：一项时滞研究
7. ON N-JOB, 2-MACHINE FLOW-SHOP SCHEDULING PROBLEM WITH ARBITRARY TIME LAGS AND TRANSPORTATION TIMES OF JOBS [O] . Parkash Lal Maggu, Manohar Lal Smghal, Noor Mohammad, 1982

机译：在N-job，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

摘要

著录项

相似文献

相关主题

期刊订阅