Abstract
This paper addresses a production scheduling problem in a single-machine environment, where a job can be either early, on time, late, or rejected. In order acceptance and scheduling contexts, it is assumed that the production capacity of a company is overloaded. The problem is therefore to decide which orders to accept and how to sequence their production. In contrast with the existing literature, the considered problem jointly takes into account the following features: earliness and tardiness penalties (which can be linear or quadratic), sequence-dependent setup times and costs, rejection penalties, and the possibility of having idle times. The practical relevance of this new NP-hard problem is discussed and various solution methods are proposed, ranging from a basic greedy algorithm to refined metaheuristics (e.g., tabu search, the adaptive memory algorithm, population-based approaches loosely inspired on ant algorithms). The methods are compared for instances with various structures containing up to 200 jobs. For small linear instances, the metaheuristics are favorably compared with an exact formulation using CPLEX 12.2. Managerial insights and recommendations are finally given.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Anghinolfi, D., Paolucci, M.: A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. Int. J. Oper. Res. 5(1), 1–17 (2008)
Atan, M.O., Akturk, M.S.: Single CNC machine scheduling with controllable processing times and multiple due dates. Int. J. Product. Res. 46(21), 6087–6111 (2008)
Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Oper. Res. 38(1), 22–36 (1990)
Baptiste, P., Le Pape, C.: Scheduling a single machine to minimize a regular objective function under setup constraints. Discret. Optim. 2(1), 83–99 (2005)
Cesaret, B., Oğuz, C., Salman, S.F.: A tabu search algorithm for order acceptance and scheduling. Comput. Oper. Res. 39(6), 1197–1205 (2012). Special Issue on Scheduling in Manufacturing Systems
Chen, Y.-W., Lu, Y.-Z., Yang, G.-K.: Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling. Int. J. Adv. Manuf. Technol. 36, 959–968 (2008)
Dorigo, M., Birattari, M., Stuetzle, T.: Ant colony optimization-artificial ants as a computational intelligence technique. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006)
Garey, M.R., Tarjan, R.E., Wilfong, G.T.: One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13(2), 330–348 (1988)
Gendreau, M., Potvin, J.-Y. (eds.): Handbook of metaheuristics. 2nd edn. Springer, New York (2010)
Hendel, Y., Sourd, F.: An improved earliness–tardiness timing algorithm. Comput. Oper. Res. 34(10), 2931–2938 (2007)
Herbots, J., Herroelen, W., Leus, R.: Dynamic order acceptance and capacity planning on a single bottleneck resource. Nav. Res. Logist. (NRL) 54(8), 874–889 (2007)
Hertz, A., Schindl, D., Zufferey, N.: A solution method for a car fleet management problem with maintenance constraints. J. Heuristics 15(5), 425–450 (2009)
Huang, S., Lu, M., Wan, G.: Integrated order selection and production scheduling under MTO strategy. Int. J. Product. Res. 49(13), 4085–4101 (2011)
Jolai, F., Sheikh, S., Rabbani, M., Karimi, B.: A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. Int. J. Adv. Manuf. Technol. 42(5–6), 523–532 (2009)
Kedad-Sidhoum, S., Sourd, F.: Fast neighborhood search for the single machine earliness–tardiness scheduling problem. Comput. Operat. Res. 37(8), 1464–1471 (2010)
Kianfar, K., Moslehi, G.: A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties. Comput. Operat. Res. 39(12), 2978–2990 (2012)
Manavizadeh, N., Goodarzi, A.H., Rabbani, M., Jolai, F.: Order acceptance/rejection policies in determining the sequence in mixed model assembly lines. Appl. Math. Model. 37(4), 2531–2551 (2013)
Mansouri, S.A., Gallear, D., Askariazad, M.H.: Decision support for build-to-order supply chain management through multiobjective optimization. Int. J. Product. Econ. 135(1), 24–36 (2012)
Martello, S., Pisinger, D., Toth, P.: New trends in exact algorithms for the 0–1 knapsack problem. Eur. J. Operat. Res. 123(2), 325–332 (2000)
Mazzini, R., Armentano, V.A.: A heuristic for single machine scheduling with early and tardy costs. Eur. J. Operat. Res. 128(1), 129–146 (2001)
Nobibon, F.T., Leus, R.: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Comput. Operat. Res. 38(January), 367–378 (2011)
Nuijten, W., Bousonville, T., Focacci, F., Godard, D., Le Pape, C.: Towards an industrial manufacturing scheduling problem and test bed. In: Proceedings of the 9th International Workshop on Project Management and Scheduling, pms (2004)
Oğuz, C., Salman, S.F., Yalçın, B.Z.: Order acceptance and scheduling decisions in make-to-order systems. Int. J. Product. Econ. 125(1), 200–211 (2010)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 5th edn. Springer, Berlin (2016)
Plumettaz, M., Schindl, D., Zufferey, N.: Ant local search and its efficient adaptation to graph colouring. J. Operat. Res. Soc. 61, 819–826 (2010)
Potts, C.N., Van Wassenhove, L.N.: A branch and bound algorithm for the total weighted tardiness problem. Operat. Res. 33(2), 363–377 (1985)
Respen, J., Zufferey, N.: Ant algorithms for a truck loading problem with multiple destinations. In: Proceedings of the 14th International Workshop on Project Management and Scheduling, PMS (2014)
Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167 (1995)
Schaller, J.: Single machine scheduling with early and quadratic tardy penalties. Comput. Ind. Eng. 46(3), 511–532 (2004)
Shabtay, D., Gaspar, N., Yedidsion, L.: A bicriteria approach to scheduling a single machine with job rejection and positional penalties. J. Comb. Optim. 23(4), 395–424 (2012)
Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. J. Sched. 16(1), 3–28 (2013)
Shakhlevich, N.V., Strusevich, V.A.: Single machine scheduling with controllable release and processing parameters. Discret. Appl. Math. 154(15), 2178–2199 (2006)
Slotnick, S.A.: Order acceptance and scheduling: a taxonomy and review. Eur. J. Operat. Res. 212(1), 1–11 (2011)
Szwarc, W., Mukhopadhyay, S.K.: Optimal timing schedules in earliness–tardiness single machine sequencing. Nav. Res. logist. 42(7), 1109–1114 (1995)
Tanaka, S., Fujikuma, S.: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. J. Sched. 15(3), 347–361 (2012)
ten Kate, H.A.: Towards a better understanding of order acceptance. Int. J. Product. Econ. 37(1), 139–152 (1994)
Thevenin, S., Zufferey, N., Widmer, M.: Tabu search for a single machine scheduling problem with rejected jobs, setups and deadlines. In: 9th International Conference of Modeling, Optimization and Simulation (MOSIM 2012) (2012)
Thevenin, S., Zufferey, N., Widmer, M.: Metaheuristics for a scheduling problem with rejection and tardiness penalties. J. Sched. 18(1), 89–105 (2015)
Valente, J., Moreira, M., Singh, A., Alves, R.: Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs. Int. J. Adv. Manuf. Technol. 54, 251–265 (2011)
Valente, J.M.S., Gonçalves, J.F.: A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput. Operat. Res. 36(October), 2707–2715 (2009)
Wan, G., Yen, B.P.-C.: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. Eur. J. Oper. Res. 142(2), 271–281 (2002)
Weng, M., Weng, M. X., Sedani, M.: Schedule one machine to minimize early/tardy penalty by tabu search. In: Proceedings of the Annual IIE Research Conference (2002)
Yalçın, B. Z., Oğuz, C., Salman, S. F.: Order acceptance and scheduling decisions in make-to-order systems. In: Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Application (mista 2007), pp. 80–87 (2007)
Zorzini, M., Corti, D., Pozzetti, A.: Due date (dd) quotation and capacity planning in make-to-order companies: results from an empirical analysis. Int. J. Product. Econ. 112(2), 919–933 (2008)
Zufferey, N.: Optimization by ant algorithms: possible roles for an individual ant. Optim. Lett. 6(5), 963–973 (2012a)
Zufferey, N.: Metaheuristics: some principles for an efficient design. Comput. Technol. Appl. 3, 446–462 (2012b)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Thevenin, S., Zufferey, N. & Widmer, M. Order acceptance and scheduling with earliness and tardiness penalties. J Heuristics 22, 849–890 (2016). https://doi.org/10.1007/s10732-016-9321-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-016-9321-x