Unrelated Parallel Machine Scheduling with Job and Machine Acceptance and Renewable Resource Allocation

被引:1
作者
Olteanu, Alexandru-Liviu [1 ]
Sevaux, Marc [1 ]
Ziaee, Mohsen [1 ,2 ]
机构
[1] Univ Bretagne Sud, Lab STICC, UMR 6285, CNRS, F-56100 Lorient, France
[2] Univ Bojnord, Dept Ind Engn, Bojnord, Iran
关键词
scheduling; unrelated parallel machines; job acceptance; machine acceptance; mixed integer linear programming; heuristics; REJECTION; NUMBER; ALGORITHMS; FLOWSHOP; TIME;
D O I
10.3390/a15110433
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, an unrelated parallel machine scheduling problem with job (product) and machine acceptance and renewable resource constraints was considered. The main idea of this research was to establish a production facility without (or with minimum) investment in machinery, equipment, and location. This problem can be applied to many real problems. The objective was to maximize the net profit; that is, the total revenue minus the total cost, including fixed costs of jobs, job transportation costs, renting costs of machines, renting cost of resources, and transportation costs of resources. A mixed-integer linear programming (MILP) model and several heuristics (greedy, GRASP, and simulated annealing) are presented to solve the problem.
引用
收藏
页数:17
相关论文
共 38 条
  • [1] Flexible flow shop scheduling problem to minimize makespan with renewable resources
    Abbaszadeh, N.
    Asadi-Gangraj, E.
    Emami, S.
    [J]. SCIENTIA IRANICA, 2021, 28 (03) : 1853 - 1870
  • [2] The production routing problem: A review of formulations and solution algorithms
    Adulyasak, Yossiri
    Cordeau, Jean-Francois
    Jans, Raf
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 55 : 141 - 152
  • [3] Optimize Unrelated Parallel Machines Scheduling Problems With Multiple Limited Additional Resources, Sequence-Dependent Setup Times and Release Date Constraints
    Al-Harkan, Ibrahim M.
    Qamhan, Ammar A.
    [J]. IEEE ACCESS, 2019, 7 : 171533 - 171547
  • [4] Optimal interval scheduling with a resource constraint
    Angelelli, Enrico
    Bianchessi, Nicola
    Filippi, Carlo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 51 : 268 - 281
  • [5] On the complexity of interval scheduling with a resource constraint
    Angelelli, Enrico
    Filippi, Carlo
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (29) : 3650 - 3657
  • [6] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
  • [7] Julia: A Fresh Approach to Numerical Computing
    Bezanson, Jeff
    Edelman, Alan
    Karpinski, Stefan
    Shah, Viral B.
    [J]. SIAM REVIEW, 2017, 59 (01) : 65 - 98
  • [8] A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
    Cao, Zhigang
    Yang, Xiaoguang
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (27-29) : 2732 - 2745
  • [9] Integrated Production and Outbound Distribution Scheduling: Review and Extensions
    Chen, Zhi-Long
    [J]. OPERATIONS RESEARCH, 2010, 58 (01) : 130 - 148
  • [10] Fanjul-Peyro L., 2020, EXPERT SYSTEMS APPL, V5, DOI [DOI 10.1016/J.ESWAX.2020.100022, 10.1016/J.ESWAX.2020.100022]