On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

Grabowski, J.; Skubalska, Ewa; Smutnicki, Czesław

doi:10.1057/jors.1983.142

Cited by 66 publications

(14 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In most of the related work, due dates are absolute and do not change when the sequence of operations changes. When due dates are involved, most algorithms try to minimize the maximum lateness [7,9]; i.e the maximum time that a job is completed later than its due date.…”

Section: Related Workmentioning

confidence: 99%

Online Scheduling of 2-Re-entrant Flexible Manufacturing Systems

Pinxten

Waqas

Geilen

et al. 2017

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

Online scheduling of operations is essential to optimize productivity of exible manufacturing systems (FMSs) where manufacturing requests arrive on the y. An FMS processes products according to a particular ow through processing stations. This work focusses on online scheduling of re-entrant FMSs with ows using processing stations where products pass twice and with limited bu ering between processing stations. This kind of FMS is modelled as a re-entrant ow shop with due dates and sequence-dependent set-up times. Such ow shops can bene t from minimization of the time penalties incurred from set-up times. On top of an existing greedy scheduling heuristic we apply a meta-heuristic that simultaneously explores several alternatives considering trade-o s between the used metrics by the scheduling heuristic. We identify invariants to e ciently remove many infeasible scheduling options so that the running time of online implementations is improved. The resulting algorithm is much faster than the state of the art and produces schedules with on average 4.6% shorter makespan.

show abstract

Section: Related Workmentioning

confidence: 99%

Online Scheduling of 2-Re-entrant Flexible Manufacturing Systems

Pinxten

Waqas

Geilen

et al. 2017

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…In the case m > 2, we can apply exact branch-and-bound algorithms (then p = 1), e.g. [5], [13] or polynomial approximation algorithms (e.g. the algorithm of Campbell et al with p = [rn/2] [10], the algorithm of Nawaz et al [9] or the algorithm of Shmoys et al with p ---O(log2m) [14]).…”

Section: Algorithm H(g)mentioning

confidence: 99%

An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

Nowicki

1993

European Journal of Operational Research

View full text Add to dashboard Cite

“…Lenstra et al [ 101 established the NP-completeness of the associated problem of minimizing maximum lateness in a two-machine flow shop. Branch-and-bound algorithms have been developed by Townsend [16] for minimizing T,,,, and by Grabowski [7] for minimizing maximum lateness subject to release times.…”

Section: Two-machine Systemsmentioning

confidence: 99%

Multiobjective flow-shop scheduling

Daniels

Chambers

1990

Naval Research Logistics

View full text Add to dashboard Cite

Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associated levels of two scheduling criteria, schedule makespan (Cmax) and maximum job tardiness (Tmax). We present constructive procedures that quantify the trade‐off between Cmax and Tmax. The significance of this trade‐off is that the optimal solution for any preference function involving only Cmax and Tmax must be contained among the set of efficient schedules that comprise the trade‐off curve. For the special case of two‐machine flow shops, we present an algorithm that identifies the exact set of efficient schedules. Heruistic procedures for approximating the efficient set are also provided for problems involving many jobs or larger flow shops. Computational results are reported for the procedures which indicate that both the number of efficient schedules and the error incurred by heuristically approximating the efficient set are quite small.

show abstract

On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

Cited by 66 publications

References 3 publications

Online Scheduling of 2-Re-entrant Flexible Manufacturing Systems

Online Scheduling of 2-Re-entrant Flexible Manufacturing Systems

An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

Multiobjective flow-shop scheduling

Contact Info

Product

Resources

About