Job shop scheduling with two jobs and nonregular objective functions

被引：0
|
作者：
Agnetis, A
Mirchandani, PB
Pacciarelli, D
Pacifici, A
机构：
[1] Univ Siena, Dipartimento Ingn Informat, I-53100 Siena, Italy
[2] Univ Arizona, Dept Syst & Ind Engn, Tucson, AZ 85721 USA
[3] Univ Roma Tre, Dipartimento Informat & Automaz, I-00146 Rome, Italy
[4] Univ Roma Tor Vergata, Dipartimento Informat Sistemi & Prod, I-00133 Rome, Italy
来源：
INFOR | 2001年 / 39卷 / 03期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider the job shop scheduling problem with two jobs. We consider a broad class of non-regular, quasi-convex functions of the completion time of the two jobs. We show that the optimal solution, for this class of objective functions, can be computed in O (r log r + log H) time, where r is the number of operation pairs using the same machine, and H is the maximum operation processing time.
引用
收藏
页码：227 / 244
页数：18
相关论文
共 50 条
  • [1] On the complexity of two machine job-shop scheduling with regular objective functions
    Brucker P.
    Kravchenko S.A.
    Sotskov Y.N.
    [J]. Operations-Research-Spektrum, 1997, 19 (1) : 5 - 10
  • [2] On the complexity of two machine job-shop scheduling with regular objective functions
    Brucker, P
    Kravchenko, SA
    Sotskov, YN
    [J]. OR SPEKTRUM, 1997, 19 (01) : 5 - 10
  • [3] Job shop scheduling with the option of jobs outsourcing
    Safarzadeh, Hamid
    Kianfar, Farhad
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (10) : 3255 - 3272
  • [4] Two-objective fuzzy job shop scheduling through genetic algorithm
    Sakawa, M
    Kubota, R
    [J]. ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2001, 84 (04): : 60 - 68
  • [5] Complexity analysis of job-shop scheduling with deteriorating jobs
    Mosheiov, G
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 117 (1-3) : 195 - 209
  • [6] MULTI OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEMS
    Kaya, Serkan
    Figlali, Nilgun
    [J]. SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI, 2013, 31 (04): : 605 - 623
  • [7] An Adaptive Scheduling Algorithm for Dynamic Jobs for Dealing with the Flexible Job Shop Scheduling Problem
    Cao, Zhengcai
    Zhou, Lijie
    Hu, Biao
    Lin, Chengran
    [J]. BUSINESS & INFORMATION SYSTEMS ENGINEERING, 2019, 61 (03) : 299 - 309
  • [8] Order-based neighborhoods for project scheduling with nonregular objective functions
    Neumann, K
    Schwindt, C
    Zimmermann, J
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) : 325 - 343
  • [9] Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm
    Jie Gao
    Mitsuo Gen
    Linyan Sun
    [J]. Journal of Intelligent Manufacturing, 2006, 17 : 493 - 507
  • [10] An Adaptive Scheduling Algorithm for Dynamic Jobs for Dealing with the Flexible Job Shop Scheduling Problem
    Zhengcai Cao
    Lijie Zhou
    Biao Hu
    Chengran Lin
    [J]. Business & Information Systems Engineering, 2019, 61 : 299 - 309
12345