Flow Shop Models and Constraint Graph Specifications

@article{PGB19,

title = {Parametric Scheduler Characterization},

author = {Joost Van Pinxten and Marc Geilen and Twan Basten},

url = {https://doi.org/10.1145/3358226},

doi = {10.1145/3358226},

issn = {1539-9087},

year  = {2019},

date = {2019-10-01},

urldate = {2019-10-01},

journal = {ACM Trans. Embed. Comput. Syst.},

volume = {18},

number = {5s},

publisher = {Association for Computing Machinery},

address = {New York, NY, USA},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{PGHB18,

title = {Parametric Critical Path Analysis for Event Networks With Minimal and Maximal Time Lags},

author = {Joost Pinxten and Marc Geilen and Martijn Hendriks and Twan Basten},

doi = {10.1109/TCAD.2018.2857360},

year  = {2018},

date = {2018-01-01},

urldate = {2018-01-01},

journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},

volume = {37},

number = {11},

pages = {2697-2708},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{PWGea17,

title = {Online Scheduling of 2-Re-Entrant Flexible Manufacturing Systems},

author = {Joost Van Pinxten and Umar Waqas and Marc Geilen and Twan Basten and Lou Somers},

url = {https://doi.org/10.1145/3126551},

doi = {10.1145/3126551},

issn = {1539-9087},

year  = {2017},

date = {2017-09-01},

urldate = {2017-09-01},

journal = {ACM Trans. Embed. Comput. Syst.},

volume = {16},

number = {5s},

publisher = {Association for Computing Machinery},

address = {New York, NY, USA},

abstract = {Online scheduling of operations is essential to optimize productivity of flexible manufacturing systems (FMSs) where manufacturing requests arrive on the fly. An FMS processes products according to a particular flow through processing stations. This work focusses on online scheduling of re-entrant FMSs with flows using processing stations where products pass twice and with limited buffering between processing stations. This kind of FMS is modelled as a re-entrant flow shop with due dates and sequence-dependent set-up times. Such flow shops can benefit 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-offs between the used metrics by the scheduling heuristic. We identify invariants to efficiently 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.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}