Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » Customer order scheduling with job-based processing on a single-machine to minimize the total completion time

Journals

  • IJIEC (777)
  • MSL (2643)
  • DSL (690)
  • CCL (528)
  • USCM (1099)
  • ESM (428)
  • AC (562)
  • JPM (293)
  • IJDS (952)
  • JFS (101)
  • HE (37)
  • SCI (36)

IJIEC Volumes

    • Volume 1 (17)
      • Issue 1 (9)
      • Issue 2 (8)
    • Volume 2 (68)
      • Issue 1 (12)
      • Issue 2 (20)
      • Issue 3 (20)
      • Issue 4 (16)
    • Volume 3 (76)
      • Issue 1 (9)
      • Issue 2 (15)
      • Issue 3 (20)
      • Issue 4 (12)
      • Issue 5 (20)
    • Volume 4 (50)
      • Issue 1 (14)
      • Issue 2 (10)
      • Issue 3 (12)
      • Issue 4 (14)
    • Volume 5 (47)
      • Issue 1 (13)
      • Issue 2 (12)
      • Issue 3 (12)
      • Issue 4 (10)
    • Volume 6 (39)
      • Issue 1 (7)
      • Issue 2 (12)
      • Issue 3 (10)
      • Issue 4 (10)
    • Volume 7 (47)
      • Issue 1 (10)
      • Issue 2 (14)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 8 (30)
      • Issue 1 (9)
      • Issue 2 (7)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 9 (32)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (7)
      • Issue 4 (10)
    • Volume 10 (34)
      • Issue 1 (8)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (8)
    • Volume 11 (36)
      • Issue 1 (9)
      • Issue 2 (8)
      • Issue 3 (9)
      • Issue 4 (10)
    • Volume 12 (29)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 13 (41)
      • Issue 1 (10)
      • Issue 2 (8)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 14 (50)
      • Issue 1 (11)
      • Issue 2 (15)
      • Issue 3 (9)
      • Issue 4 (15)
    • Volume 15 (55)
      • Issue 1 (19)
      • Issue 2 (15)
      • Issue 3 (12)
      • Issue 4 (9)
    • Volume 16 (75)
      • Issue 1 (12)
      • Issue 2 (15)
      • Issue 3 (19)
      • Issue 4 (29)
    • Volume 17 (51)
      • Issue 1 (21)
      • Issue 2 (30)

Keywords

Supply chain management(168)
Jordan(165)
Vietnam(151)
Customer satisfaction(120)
Performance(115)
Supply chain(112)
Service quality(98)
Competitive advantage(97)
Tehran Stock Exchange(94)
SMEs(89)
Sustainability(87)
Artificial intelligence(87)
optimization(87)
Financial performance(84)
Trust(83)
TOPSIS(83)
Job satisfaction(81)
Knowledge Management(79)
Factor analysis(78)
Social media(78)


» Show all keywords

Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(66)
Mohammad Reza Iravani(64)
Endri Endri(45)
Muhammad Alshurideh(42)
Hotlan Siagian(40)
Dmaithan Almajali(37)
Jumadil Saputra(36)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Barween Al Kurdi(32)
Hassan Ghodrati(31)
Basrowi Basrowi(31)
Sautma Ronni Basana(31)
Mohammad Khodaei Valahzaghard(30)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Haitham M. Alzoubi(28)
Sulieman Ibraheem Shelash Al-Hawary(28)
Prasadja Ricardianto(28)


» Show all authors

Countries

Iran(2198)
Indonesia(1311)
Jordan(815)
India(798)
Vietnam(510)
Saudi Arabia(478)
Malaysia(447)
China(231)
United Arab Emirates(226)
Thailand(160)
United States(115)
Turkey(114)
Ukraine(110)
Egypt(106)
Peru(94)
Canada(93)
Morocco(87)
Pakistan(85)
United Kingdom(80)
Nigeria(78)


» Show all countries

International Journal of Industrial Engineering Computations

ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 12 Issue 3 pp. 273-292 , 2021

Customer order scheduling with job-based processing on a single-machine to minimize the total completion time Pages 273-292 Right click to download the paper Download PDF

Authors: Ferda Can Çetinkaya, Pınar Yeloğlu, Hale Akkocaoğlu Çatmakaş

DOI: 10.5267/j.ijiec.2021.3.001

Keywords: Customer order scheduling, Order-based processing, Job-based processing, Total completion time, Mixed-integer linear programming, Tabu search

Abstract: This study considers a customer order scheduling (COS) problem in which each customer requests a variety of products (jobs) processed on a single flexible machine, such as the computer numerical control (CNC) machine. A sequence-independent setup for the machine is needed before processing each product. All products in a customer order are delivered to the customer when they are processed. The product ordered by a customer and completed as the last product in the order defines the customer order’s completion time. We aim to find the optimal schedule of the customer orders and the products to minimize the customer orders’ total completion time. We have studied this customer order scheduling problem with a job-based processing approach in which the same products from different customer orders form a product lot and are processed successively without being intermingled with other products. We have developed two mixed-integer linear programming models capable of solving the small and medium-sized problem instances optimally and a heuristic algorithm for large-sized problem instances. Our empirical study results show that our proposed tabu search algorithm provides optimal or near-optimal solutions in a very short time. We have also compared the job-based and order-based processing approaches for both setup and no-setup cases and observed that the job-based processing approach yields better results when jobs have setup times.

How to cite this paper
Çetinkaya, F., Yeloğlu, P & Çatmakaş, H. (2021). Customer order scheduling with job-based processing on a single-machine to minimize the total completion time.International Journal of Industrial Engineering Computations , 12(3), 273-292.

Refrences
Ahmadi, R.H., & Bagchi, U. (1990). Scheduling of multi-job customer orders in multi-machine environments. ORSA/TIMS, Philadelphia.
Bagchi, U., Julien, F.M., & Magazine, M.J. (1994). Note: due-date assignment to multi-job customer orders. Management Science, 40(10), 1389–1392.
Baker, K.R. (1988). Scheduling the production of components at a common facility. IIE Transactions, 20(1), 32–35.
Cheng, T.C.E., Ng, C.T., & Yuan, J.J. (2203). A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Journal of Scheduling, 6, 551–555.
Coffman, E.G., Nozari, A., & Yannakakis, M. (1989). Optimal scheduling of products with two subassemblies on a single machine. Operations Research, 37(3), 426-436.
Çetinkaya, F.C., Çatmakaş, H.A., & Görür, A.K. (2019). Single-machine scheduling of indivisible multi-operation jobs. South African Journal of Industrial Engineering, 30(3), 78–93.
Erel, E., & Ghosh, J.B. (2007). Customer order scheduling on a single machine with family setup times: Complexity and algorithms. Applied Mathematics and Computation, 185(1), 11–18.
Gerodimos, A.E., Glass, C.A., Potts, C.N., & Tautenhahn, T. (1999). Scheduling multi-operation jobs on a single machine. Annals of Operations Research, 92(1–4), 87–105.
Glover F. (1989). Tabu search¬¬ - Part I. ORSA Journal of Computing, 1, 190–206.
Graham, R.L., Lawler, E.L., Lenstr, J.K., & Rinnooy Kan, A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.
Hazır, O., Günalay, Y., & Erel, E. (2008). Customer order scheduling problem: A comparative metaheuristics study. International Journal of Advanced Manufacturing Technology, 3(5-6), 589–598.
Julien, F.M., & Magazine, M.J. (1990). Scheduling customer orders: an alternative production scheduling approach. Journal of Manufacturing and Operations Management, 3, 177–199.
Liu, C.H. (2009). Lot streaming for customer order scheduling problem in job shop environments. International Journal of Computer Integrated Manufacturing 22(9), 890–907.
Nawaz, M., Enscore, E., & Ham, I. (1983). A heuristic for the m-machine, n-job flow shop sequencing problem, Omega, 5(11), 91.
Ng, D., Cheng, T.C.E., & Yuan, J.J. (2002). Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. Information Processing Letters, 82, 187–191.
Pinedo, M.L. (2008). Scheduling: Theory, Algorithms and Systems. Springer: New York.
Smith, W.E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3(1), 59–66.
Su, L.H. & Chen, Y.H. 2009. Scheduling multi-operation jobs on a single flexible machine. International Journal of Advanced Manufacturing Technology, 42, 1165–1174.
Vickson, R.G., Magazine, M.J., & Santos, C.A. (1993) Batching and sequencing of components at a single facility. IIE Transactions, 25(2), 65–70.
Yang, D.L., Hou, Y.T., & Kuo, W.H. (2017). A note on a single-machine lot scheduling problem with indivisible orders. Computers and Operations Research, 79, 34–38.
Yang, J. (2011). Customer order scheduling in a two machine flowshop, International Journal of Management Science, 17(1), 1921–1939.
  • 17
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: International Journal of Industrial Engineering Computations | Year: 2021 | Volume: 12 | Issue: 3 | Views: 1255 | Reviews: 0

Related Articles:
  • Optimization costs of the single-machine scheduling problem with maintenanc ...
  • A branch and bound for single machine stochastic scheduling to minimize the ...
  • Single-machine batch scheduling minimizing weighted flow times and delivery ...
  • A new mathematical model for single machine batch scheduling problem for mi ...
  • A mathematical model for weighted tardy jobs scheduling problem with a batc ...

Add Reviews

Name:*
E-Mail:
Review:
Bold Italic Underline Strike | Align left Center Align right | Insert smilies Insert link URLInsert protected URL Select color | Add Hidden Text Insert Quote Convert selected text from selection to Cyrillic (Russian) alphabet Insert spoiler
winkwinkedsmileam
belayfeelfellowlaughing
lollovenorecourse
requestsadtonguewassat
cryingwhatbullyangry
Security Code: *
Include security image CAPCHA.
Refresh Code

® 2010-2026 GrowingScience.Com