Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time

被引:0
作者
Jun Pei
Xinbao Liu
Panos M. Pardalos
Kai Li
Wenjuan Fan
Athanasios Migdalas
机构
[1] Hefei University of Technology,School of Management
[2] University of Florida,Department of Industrial and Systems Engineering, Center for Applied Optimization
[3] Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education,Division of Industrial Logistics, Department of Industrial Engineering
[4] Lulea University of Technology,Division of Transportation, Construction Management and Regional Planning, Department of Civil Engineering
[5] Aristotle University of Thessaloniki,undefined
来源
Optimization Letters | 2017年 / 11卷
关键词
Scheduling; Availability constraint; Serial-batching; Single-machine; Position-dependent processing time;
D O I
暂无
中图分类号
学科分类号
摘要
This article considers the single-machine serial-batching scheduling problem with a machine availability constraint, position-dependent processing time, and time-dependent set-up time. The objective of this problem is to make the decision of batching jobs and sequencing batches to minimize the makespan. To solve the problem, three cases of machine non-availability periods are considered, and the structural properties of the optimal solution are derived for each case. Based on these structural properties, an optimization algorithm is developed and an example is proposed to illustrate this algorithm.
引用
收藏
页码:1257 / 1271
页数:14
相关论文
共 50 条
  • [31] Single-machine group scheduling with processing times dependent on position, starting time and allotted resource
    Yin, Na
    Kang, Liying
    Wang, Xiab-Yuan
    APPLIED MATHEMATICAL MODELLING, 2014, 38 (19-20) : 4602 - 4613
  • [32] Single-machine scheduling time-dependent jobs with resource-dependent ready times
    Zhu, Valerie C. Y.
    Sun, Linyan
    Sun, Linhui
    Li, Xiaohong
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (01) : 84 - 87
  • [33] Two-agent single-machine scheduling with position-dependent processing times
    Peng Liu
    Xiaoye Zhou
    Lixin Tang
    The International Journal of Advanced Manufacturing Technology, 2010, 48 : 325 - 331
  • [34] Two-agent single-machine scheduling with position-dependent processing times
    Liu, Peng
    Zhou, Xiaoye
    Tang, Lixin
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 48 (1-4) : 325 - 331
  • [35] Single-machine group scheduling with new models of position-dependent processing times
    Zhang, Xin
    Liao, Lijuan
    Zhang, Wenya
    Cheng, T. C. E.
    Tan, Yuanyuan
    Ji, Min
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 117 : 1 - 5
  • [36] Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
    Kuo, Wen-Hung
    Yang, Dar-Li
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (02) : 1184 - 1190
  • [37] SINGLE-MACHINE SCHEDULING WITH START TIME-DEPENDENT PROCESSING TIMES - SOME SOLVABLE CASES
    SUNDARARAGHAVAN, PS
    KUNNATHUR, AS
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 78 (03) : 394 - 403
  • [38] Minimizing cycle time in single machine scheduling with start time-dependent processing times
    Mehdi Hosseinabadi Farahani
    Leila Hosseini
    The International Journal of Advanced Manufacturing Technology, 2013, 64 : 1479 - 1486
  • [39] Minimizing cycle time in single machine scheduling with start time-dependent processing times
    Farahani, Mehdi Hosseinabadi
    Hosseini, Leila
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 64 (9-12) : 1479 - 1486
  • [40] Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
    Xue Huang
    Gang Li
    Yunzhang Huo
    Ping Ji
    Optimization Letters, 2013, 7 : 1793 - 1804