125
Views
19
CrossRef citations to date
0
Altmetric
General Paper

A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity

, &
Pages 1906-1918 | Received 16 Jun 2014, Accepted 06 Mar 2015, Published online: 21 Dec 2017

References

  • AdiriIFrostigERinnooy KanAHGScheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobsNaval Research Logistics199138226127110.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I
  • AzizogluMKircaOTardiness minimization on parallel machinesInternational Journal of Production Economics199855216316810.1016/S0925-5273(98)00034-6
  • ChenWJMinimizing number of tardy jobs on a single machine subject to periodic maintenanceOmega200937359159910.1016/j.omega.2008.01.001
  • Chen CC (2014). TOYOTA: Let’s Go Places, http://www.toyota.com.tw/, accessed on 1 December 2014.
  • ChengTCEHsuCJYangDLUnrelated parallel-machine scheduling with deteriorating maintenance activitiesComputers & Industrial Engineering201160460260510.1016/j.cie.2010.12.017
  • DuJLeungJYTMinimizing total tardiness on one machine is NP-hardMathematics of Operations Research199015348349510.1287/moor.15.3.483
  • GhodratnamaARabbaniMTavakkoli-MoghaddamRBaboliASolving a single-machine scheduling problem with maintenance, job deterioration and learning effect by simulated annealingJournal of Manufacturing Systems20102911910.1016/j.jmsy.2010.06.004
  • Goldberg DE and Lingle R (1985). Alleles, loci and the traveling salesman problem. In: Proceedings of an International Conference on Genetic Algorithms and Their Application. Lawrence Erlbaum Associates: Hillsdale, NJ, pp 154-159.
  • GustavssonEPatrikssonMStrombergABWojciechowskiAOnnheimMPreventive maintenance scheduling of multi-component systems with interval costsComputers & Industrial Engineering20147639040010.1016/j.cie.2014.02.009
  • Huang TB (2014). Cheng Drong Aluminium Co., Ltd., http://www.cdal.com.tw/, accessed on 1 December 2014.
  • JooCMKimBSGenetic algorithms for single machine scheduling with time-dependent deterioration and rate-modifying activitiesExpert Systems with Applications20134083036304310.1016/j.eswa.2012.12.019
  • LeeJYKimYDMinimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenanceComputers & Operations Research20123992196220510.1016/j.cor.2011.11.002
  • LeeCYLimanSDSingle machine flow-time scheduling with scheduled maintenanceActa Informatica199229437538210.1007/BF01178778
  • LopezEGO’NeillMOn the effects of locality in a permutation problem: The Sudoku puzzleIEEE Symposium on Computational Intelligence and Games20098087
  • LuoWChengTCEJiMSingle-machine scheduling with a variable maintenance activityComputers & Industrial Engineering20157916817410.1016/j.cie.2014.11.002
  • MaYChuCZuoCA survey of scheduling with deterministic machine availability constraintsComputers & Industrial Engineering201058219921110.1016/j.cie.2009.04.014
  • MadhushiniNRajendranCDeepaYBranch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobsJournal of the Operational Research Society2009607991100410.1057/palgrave.jors.2602642
  • PinedoMLScheduling: Theory, Algorithms, and System2008
  • QiXChenTTuFScheduling the maintenance on a single machineJournal of the Operational Research Society199950101071107810.1057/palgrave.jors.2600791
  • SbihiMVarnierCSingle-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardinessComputers & Industrial Engineering200855483084010.1016/j.cie.2008.03.005
  • SchallerJValenteJMSAn evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardinessJournal of the Operational Research Society201264680581610.1057/jors.2012.94
  • SchmidtGScheduling with limited machine availabilityEuropean Journal of Operational Research2000121111510.1016/S0377-2217(98)00367-1
  • ShenLWangDWangXYParallel-machine scheduling with non-simultaneous machine available timeApplied Mathematical Modelling20133775227523210.1016/j.apm.2012.09.053
  • ShimSOKimYDScheduling on parallel identical machines to minimize total tardinessEuropean Journal of Operational Research2007177113514610.1016/j.ejor.2005.09.038
  • WangJBWeiCMParallel machine scheduling with a deteriorating maintenance activity and total absolute differences penaltiesApplied Mathematics and Computation2011217208093809910.1016/j.amc.2011.03.010
  • XuDXiongSMinimizing total flow time in the single-machine scheduling problem with periodic maintenanceJournal of the Operational Research Society201263456756710.1057/jors.2011.71
  • YangSJSingle-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance considerationApplied Mathematics and Computation201021773321332910.1016/j.amc.2010.08.064
  • YangSJSingle-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities considerationComputers & Industrial Engineering201262127127510.1016/j.cie.2011.09.014
  • YangSJUnrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion timeApplied Mathematical Modelling20133752995300510.1016/j.apm.2012.07.029
  • YangSLMaYXuDLYangJBMinimizing total completion time on a single machine with a flexible maintenance activityComputers & Operations Research201138475577010.1016/j.cor.2010.09.003
  • YinYQWuWHWuWHWuCCA branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effectsInformation Sciences20142569110810.1016/j.ins.2013.07.026
  • YuXZhangYXuDYinYSingle machine scheduling problem with two synergetic agents and piece-rate maintenanceApplied Mathematical Modelling20133731390139910.1016/j.apm.2012.04.009

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.