35
Views
30
CrossRef citations to date
0
Altmetric
General Paper

Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents

&
Pages 151-157 | Received 01 May 2012, Accepted 01 Jan 2013, Published online: 21 Dec 2017

References

  • AgnetisAMirchandaniPBPacciarelliDPacificiAScheduling problems with two competing agentsOperations Research200452222924210.1287/opre.1030.0092
  • AgnetisAMirchandaniPBPacciarelliDPacificiAMulti-agent single machine schedulingAnnals of Operations Research2007150131510.1007/s10479-006-0164-y
  • AgnetisAPascaleGPacciarelliDA Lagrangian approach to single-machine scheduling problems with two competing agentsJournal of Scheduling200912440141510.1007/s10951-008-0098-0
  • BakerKRSmithJCA multiple-criterion model for machine schedulingJournal of Scheduling20036171610.1023/A:1022231419049
  • ChengTCENgCTYuanJJMulti-agent scheduling on a single machine to minimize total weighted number of tardy jobsTheoretical Computer Science20063621–327328110.1016/j.tcs.2006.07.011
  • Cheng TCE, Ng CT and Yuan JJ (2007). Two-agent scheduling on a single machine with fixed jobs and preemption. Working paper, Department of Logistics, Hong Kong Polytechnic University.
  • ChengTCENgCTYuanJJMulti-agent scheduling on a single machine with max-form criteriaEuropean Journal of Operational Research2008188260360910.1016/j.ejor.2007.04.040
  • ChengTCEChengS-RWuW-HHsuP-HWuC-CA two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerationsComputers & Industrial Engineering201160453454110.1016/j.cie.2010.12.008
  • GawiejnowiczSLeeW-CLinC-LWuC-CSingle-machine scheduling of proportionally deteriorating jobs by two agentsJournal of the Operational Research Society201162111983199110.1057/jors.2010.171
  • GerstlEMosheiovGScheduling problems with two competing agents to minimize weighted earliness-tardinessComputers & Operations Research201240110911610.1016/j.cor.2012.05.019
  • LawlerELOptimal sequencing of a single machine subject to precedence constraintsManagement Science197319554454610.1287/mnsc.19.5.544
  • LeeKChoiB-CLeungJY-TPinedoMLApproximation algorithms for multi-agent scheduling to minimize total weighted completion timeInformation Processing Letters20091091691391710.1016/j.ipl.2009.04.018
  • LeungJY-TPinedoMWanGCompetitive two-agent scheduling and its applicationsOperations Research201058245846910.1287/opre.1090.0744
  • LiD-CHsuP-HSolving a two-agent single-machine scheduling problem considering learning effectComputers & Operations Research20123971644165110.1016/j.cor.2011.09.018
  • LiSYuanJUnbounded parallel-batching scheduling with two competitive agentsJournal of Scheduling201215562964010.1007/s10951-011-0253-x
  • Liu P and Tang L (2008). Two-agent scheduling with linear deteriorating jobs on single machine. In Proceedings of the 14th Annual International Conference on Computing and Combinatorics, pp 642-650, Dalian, China.
  • LiuPTangLZhouXTwo-agent group scheduling with deteriorating jobs on a single machineThe International Journal of Advanced Manufacturing Technology2009475–8657664
  • LiuPZhouXTangLTwo-agent single-machine scheduling with position-dependent processing timesThe International Journal of Advanced Manufacturing Technology2010481–432533110.1007/s00170-009-2259-5
  • MooreJMAn n job, one machine sequencing algorithm for minimizing the number of late jobsManagement Science196815110210910.1287/mnsc.15.1.102
  • MorBMosheiovGScheduling problems with two competing agents to minimize minmax and minsum earliness measuresEuropean Journal of Operational Research2010206354054610.1016/j.ejor.2010.03.003
  • MorMMosheiovGSingle machine batch scheduling with two competing agents to minimize total flowtimeEuropean Journal of Operational Research2011215352453110.1016/j.ejor.2011.06.037
  • NgCTChengCTEYuanJJA note on the complexity of the two-agent scheduling on a single machineJournal of Combinatorial Optimization200612438739410.1007/s10878-006-9001-0
  • PinedoMScheduling: Theory, Algorithms, and Systems2012
  • WanGVakatiSRLeungJY-TPinedoMScheduling two agents with controllable processing timesEuropean Journal of Operational Research2010205352853910.1016/j.ejor.2010.01.005
  • YinYChengS-RWuC-CScheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penaltiesInformation Sciences201218928229210.1016/j.ins.2011.11.035
  • YinYWuW-HChengS-RWuC-CAn investigation on a two-agent single-machine scheduling problem with unequal release datesComputers & Operations Research201239123062307310.1016/j.cor.2012.03.012
  • YinYChengS-RChengTCEWuW-HWuC-CTwo-agent single-machine scheduling with release times and deadlinesInternational Journal of Shipping and Transport Logistics201251759410.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:

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.