142
Views
25
CrossRef citations to date
0
Altmetric
General Paper

Order acceptance and scheduling on two identical parallel machines

, , &
Pages 1755-1767 | Received 06 Oct 2014, Accepted 07 Jan 2015, Published online: 21 Dec 2017

References

  • CesaretBOğuzCSalmanFSA tabu search algorithm for order acceptance and schedulingComputers and Operations Research20123961197120510.1016/j.cor.2010.09.018
  • EmmonsHOne machine sequencing to minimize certain functions of job tardinessOperations Research196917470171510.1287/opre.17.4.701
  • FisherMLA dual algorithm for the one-machine scheduling problemMathematical Programming197611122923110.1007/BF01580393
  • GharbiALadhariTMsakniMKSerairiMThe two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategiesEuropean Journal of Operational Research20132311697810.1016/j.ejor.2013.05.031
  • GhoshJBJob selection in a heavily loaded shopComputers and Operations Research199724214114510.1016/S0305-0548(96)00045-7
  • GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimization and approximation in deterministic sequencing and scheduling: A surveyAnnals of Discrete Mathematics1979528732610.1016/S0167-5060(08)70356-X
  • KeskinocakPTayurSDue date management policiesHandbook of Quantitative Supply Chain Analysis: Modeling in the E-business Era2004485547
  • LenstraJKRinnooy KanAHGBruckerPComplexity of machine scheduling problemsAnnals of Discrete Mathematics1977134336210.1016/S0167-5060(08)70743-X
  • LinS-WYingK-CIncreasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithmJournal of the Operational Research Society201364229331110.1057/jors.2012.47
  • MaoKPanQ-KPangXFChaiT-YA novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting processEuropean Journal of Operational Research20142361516010.1016/j.ejor.2013.11.010
  • OğuzCSalmanFSYalcinZBOrder acceptance and scheduling decisions in make-to-order systemsInternational Journal of Production Economics2010125120021110.1016/j.ijpe.2010.02.002
  • PottsCNvan WassenhoveLNA branch and bound algorithm for the total weighted tardiness problemOperations Research198533236337710.1287/opre.33.2.363
  • RomWOSlotnickSAOrder acceptance using genetic algorithmsComputers and Operations Research20093661758176710.1016/j.cor.2008.04.010
  • SlotnickSAOrder acceptance and scheduling: A taxonomy and reviewEuropean Journal of Operational Research2011212111110.1016/j.ejor.2010.09.042
  • SlotnickSAMortonTESelecting jobs for a heavily loaded shop with lateness penaltiesComputers and Operations Research199623213114010.1016/0305-0548(95)00015-E
  • SlotnickSAMortonTEOrder acceptance with weighted tardinessComputers and Operations Research200734103029304210.1016/j.cor.2005.11.012
  • Talla NobibonFLeusRExact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environmentComputers and Operations Research201138136737810.1016/j.cor.2010.06.003
  • TanakaSArakiMA branch and bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machinesInternational Journal of Production Economics2008113144645810.1016/j.ijpe.2007.10.006
  • WangX-LXieX-ZChengTCEOrder acceptance and scheduling in a two-machine flowshopInternational Journal of Production Economics2013141136637610.1016/j.ijpe.2012.08.020
  • WangX-LXieX-ZChengTCEA modified artificial bee colony algorithm for order acceptance in two-machine flow shopsInternational Journal of Production Economics20131411142310.1016/j.ijpe.2012.06.003
  • Wang X-L, Zhu Q-Q and Cheng TCE (2015). Subcontracting price schemes for order acceptance and scheduling, Omega, The International Journal of Management Science. http://dx.doi.org/10.1016/j.omega.2015.01.005.

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.