Minimizing Lmax for the single machine scheduling problem with family set-ups

被引：8
|
作者：
Schultz, SR
Hodgson, TJ
King, RE
Taner, MR
机构：
[1] N Carolina State Univ, Dept Ind Engn, Raleigh, NC 27695 USA
[2] Mercer Univ, Dept Mech & Ind Engn, Macon, GA 31207 USA
[3] Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey
来源：
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2004年 / 42卷 / 20期
关键词：
D O I：
10.1080/00207540410001716561
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of problems. It performs well compared with other heuristics, and it is effective in finding solutions for large problems.
引用
收藏
页码：4315 / 4330
页数：16
相关论文
共 50 条
  • [41] Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
    Débora P. Ronconi
    Warren B. Powell
    Journal of Scheduling, 2010, 13 : 597 - 607
  • [42] A Discrete Chimp Optimization Algorithm for Minimizing Tardy/Lost Penalties on a Single Machine Scheduling Problem
    Moharam, Riham
    Ali, Ahmed F.
    Morsy, Ehab
    Ahmed, Mohamed Ali
    Mostafa, Mostafa-Sami M.
    IEEE ACCESS, 2022, 10 : 52126 - 52138
  • [43] Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
    Bouska, Michal
    Suchaa, Premysl
    Novak, Antonin
    Hanzalek, Zdenek
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (03) : 990 - 1006
  • [44] Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem
    Kianfar, K.
    Moslehi, G.
    Nookabadi, A. S.
    COMPUTATIONAL & APPLIED MATHEMATICS, 2018, 37 (02): : 867 - 895
  • [45] Minimizing makespan in a single-machine scheduling problem with a learning effect and fuzzy processing times
    Ahmadizar, Fardin
    Hosseini, Leila
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 65 (1-4): : 581 - 587
  • [46] Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
    Ronconi, Debora P.
    Powell, Warren B.
    JOURNAL OF SCHEDULING, 2010, 13 (06) : 597 - 607
  • [47] Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
    Batsyn, Mikhail
    Goldengorin, Boris
    Pardalos, Panos M.
    Sukhov, Pavel
    OPTIMIZATION METHODS & SOFTWARE, 2014, 29 (05): : 955 - 963
  • [48] MINIMIZING LATE JOBS IN THE GENERAL ONE MACHINE SCHEDULING PROBLEM
    DAUZEREPERES, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 81 (01) : 134 - 142
  • [49] Minimizing the total machine workload for the wafer probing scheduling problem
    Pearn, WL
    Chung, SH
    Yang, MH
    IIE TRANSACTIONS, 2002, 34 (02) : 211 - 220
  • [50] Heuristics for Uniform Parallel Machine Scheduling Problem with Minimizing Makespan
    Li, Kai
    Zhang, Shu-chu
    2008 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2008, : 273 - 278
12345