Advanced search
Publication Cover
Journal of the Operational Research Society Volume 68, 2017 - Issue 2
Submit an article Journal homepage
44
Views
10
CrossRef citations to date
0
Altmetric
Article

A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect

Wen-Hung WuDepartment of Business AdministrationKang-Ning UniversityTaipeiTaiwan
,
Yunqiang YinFaculty of ScienceKunming University of Science and Technology650093KunmingChina
,
T C E ChengDepartment of Logistics and Maritime StudiesThe Hong Kong Polytechnic University Hung Hom KowloonHong Kong
,
Win-Chin LinDepartment of StatisticsFeng Chia UniversityTaichungTaiwan
,
Juei-Chao ChenDepartment of Statistics and Information Science & Graduate Institute of Applied StatisticsFu-Jen Catholic UniversityTaipei CountyTaipeiTaiwan
,
Shin-Yi LuoDepartment of StatisticsFeng Chia UniversityTaichungTaiwan
&
Chin-Chia WuDepartment of StatisticsFeng Chia UniversityTaichungTaiwanCorrespondence[email protected]
 show all
Pages 111-120 | Received 21 Dec 2015, Accepted 24 May 2016, Published online: 21 Dec 2017

References

  • AgnetisAMirchandaniPBPacciarelliDPacificiAScheduling problems with two competing agentsOperations Research200452222924210.1287/opre.1030.0092
  • AgnetisABillautJ-CGawiejnoviczSPacciarelliDSoukhalAMultiagent Scheduling2014Models and AlgorithmsSpringer-Verlag
  • AlidaeeBWomerNKScheduling with time dependent processing times: Review and extensionsJournal of the Operational Research Society199950771172010.1057/palgrave.jors.2600740
  • ArbibCSmriglioSServilioMA competitive scheduling problem and its relevances to UMTS channel assignmentNetworks200444213214110.1002/net.20023
  • BakerKRSmithJCA multiple-criterion model for machine schedulingJournal of Scheduling20036171610.1023/A:1022231419049
  • Ben-AriehDMaimonOAnnealing method for PCB assembly scheduling on two sequential machinesInternational Journal of Computer Integrated Manufacturing19925636136710.1080/09511929208944543
  • BiskupDSingle-machine scheduling with learning considerationsEuropean Journal of Operational Research1999115217317810.1016/S0377-2217(98)00246-X
  • BiskupDA state-of-the-art review on scheduling with learning effectEuropean Journal of Operational Research2008188231532910.1016/j.ejor.2007.05.040
  • ChengTCEWangGSingle machine scheduling with learning effect considerationsAnnals of Operations Research2000981–427329010.1023/A:1019216726076
  • ChengTCEDingQLinBMTA concise survey of scheduling with time-dependent processing timesEuropean Journal of Operational Research2004152111310.1016/S0377-2217(02)00909-8
  • ChengTCEChengSRWuWHHsuPHWuCCA two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerationsComputers & Industrial Engineering201160453454110.1016/j.cie.2010.12.008
  • ChengTCEWuWHChengSRWuCCTwo-agent scheduling with position-based deteriorating jobs and learning effectsApplied Mathematics and Computation2011217218804882410.1016/j.amc.2011.04.005
  • EtilerOTokluBAtakMWilsonJA generic algorithm for flow shop scheduling problemsJournal of the Operations Research Society200455883083510.1057/palgrave.jors.2601766
  • FisherMLA dual algorithm for the one-machine scheduling problemMathematical Programming197111122925110.1007/BF01580393
  • GawiejnowiczSTime-Dependent Scheduling2008BerlinSpringer
  • HallNGPottsCNRescheduling for new ordersOperations Research200452344045310.1287/opre.1030.0101
  • JaniakAKrysiakTTrelaRScheduling Problems with Learning and Ageing Effects: A SurveyDecision Making in Manufacturing and Services201151–21936
  • KirkpatrickSGelattCVecchiMOptimization by simulated annealingScience1983220459867168010.1126/science.220.4598.671
  • KoulamasCKyparisisGJSingle-machine and two-machine flowshop scheduling with general learning functionsEuropean Journal of Operational Research2007178240240710.1016/j.ejor.2006.01.030
  • KuoWHYangDLMinimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effectEuropean Journal of Operational Research200617421184119010.1016/j.ejor.2005.03.020
  • LeungJYTPinedoMWanGCompetitive two agent scheduling and its applicationsOperations Research200958245846910.1287/opre.1090.0744
  • LenstraJKRinnooy KanAHGBruckerPComplexity of machine scheduling problemsAnnals of Discrete Mathematics1977134336210.1016/S0167-5060(08)70743-X
  • LiD-CHsuP-HSolving a two-agent single-machine scheduling problem considering learning effectComputers & Operations Research20123971644165110.1016/j.cor.2011.09.018
  • LiGWangX-YWangJ-BSunL-YWorst case analysis of flow shop scheduling problems with a time-dependent learning effectInternational Journal of Production Economics201314219810410.1016/j.ijpe.2012.10.015
  • LiuPTangLTwo-agent scheduling with linear deteriorating jobs on a single machineLecture Notes in Computer Science2008509264265010.1007/978-3-540-69733-6_63
  • MonchLBalasubramanianHFowlerJWPfundMEHeuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready timesComputers and Operations Research200532112731275010.1016/j.cor.2004.04.001
  • ReeverCHeuristics for scheduling a single machine subject to unequal job release timesEuropean Journal of Operational Research199580239740310.1016/0377-2217(93)E0290-E
  • WuC-CLeeWC LeeChenTHeuristic algorithms for solving the maximum lateness scheduling problem with learning considerationsComputers and Industrial Engineering200752112413210.1016/j.cie.2006.10.007
  • WuW-HChengS-RWuC-CYinYAnt colony algorithms for two-agent scheduling with sum-of-processing-times-based learning and deteriorating considerationsJournal of Intelligent Manufacturing20122351985199310.1007/s10845-011-0525-5
  • YinYChengS-RWuC-CScheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penaltiesInformation Sciences201218928229210.1016/j.ins.2011.11.035
  • YinYChengS-RChengTCEWuW-HWuC-CTwo-agent single-machine scheduling with release times and deadlinesInternational Journal of Shipping and Transport Logistics201351759410.1504/IJSTL.2013.050590

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.