Open Access
| Issue |
MATEC Web Conf.
Volume 200, 2018
International Workshop on Transportation and Supply Chain Engineering (IWTSCE’18)
|
|
|---|---|---|
| Article Number | 00001 | |
| Number of page(s) | 7 | |
| DOI | https://doi.org/10.1051/matecconf/201820000001 | |
| Published online | 14 September 2018 | |
- S.A. Kravchenko and F. Werner, Parallel machine scheduling problems with a single server, Mathematical and Computer Modeling, 26, 1–11, 1997. [CrossRef] [Google Scholar]
- P. Brucker, C. Dhaenens-Flipo, S. Knust, S. Kravchenko, A. Svetlana and F. Werner, Complexity results for parallel machine problems with a single server, Journal of Scheduling, 5, 429–457, 2002. [CrossRef] [Google Scholar]
- A.H. Abdekhodaee and A. Wirth, Scheduling parallel machines with a single server: some solvable cases and heuristics, Computers & Operations Research, 29, 295–315, 2002. [CrossRef] [Google Scholar]
- A.H. Abdekhodaee, A. Wirth and H.S. Gan, Equal processing and equal setup time cases of scheduling parallel machines with a single server, Computers & Operations Research, 31, 1867–1889, 2004. [CrossRef] [Google Scholar]
- A.H. Abdekhodaee, A. Wirth and H.S. Gan, Scheduling two parallel machines with a single server: the general case, Computers & Operations Research, 33, 994–1009, 2006. [CrossRef] [Google Scholar]
- H. S. Gan, A. Wirth and A.H. Abdekhodaee, A branch-and-price algorithm for the general case of scheduling parallel machines with a single server, Computers & Operations Research, 39 (9), 2242–2247, 2012. [CrossRef] [Google Scholar]
- K. Hasani, S.A. Kravchenko and F. Werner, Simulated annealing and genetic algorithms for the twomachine scheduling problem with a single server, International Journal of Production Research, 52 (13), 3778–3792, 2014. [CrossRef] [Google Scholar]
- K. Hasani, S.A. Kravchenko and F. Werner, Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances, Engineering Optimization, 48, 173–183, 2016. [CrossRef] [Google Scholar]
- J.P. Arnaout, Heuristics for the two machine scheduling problem with a single server, International Transactions in Operational Research, 24 (6), 1347–1355, 2017. [CrossRef] [Google Scholar]
- M.Y. Kim and Y.H. Lee, MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server, Computers & Operations Research, 39, 2457–2468, 2012. [CrossRef] [Google Scholar]
- A. El idrissi, R. Benmansour, M. Benbrahim, D. Duviver, MIP formulations for identical parallel machine scheduling problem with single server, Proceedings of 4th IEEE International Conference on Optimization and Applications (ICOA), 2018. [Google Scholar]
- C.P. Koulamas, M.L. Smith, Look-ahead scheduling for minimizing machine interference, International Journal of Production Research, 26 (9), 1523–1533, 1988. [CrossRef] [Google Scholar]
- R. Benmansour, O. Braun, H. Allaoui, Modeling the single processor scheduling problem with time restrictions as a parallel machine scheduling problem, Proceeding of 7th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), 2015. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.