FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4207026062> ?p ?o ?g. }

• W4207026062 endingPage "1530" @default.
• W4207026062 startingPage "1512" @default.
• W4207026062 abstract "This paper addresses a single machine total weighted tardiness (TWT) batch-scheduling problem in which jobs have release dates, nonidentical sizes, and are compatible between each other. We propose two integer linear programming models: the first one is a time-indexed formulation (TIF), and the second is an innovative time-size-indexed formulation (TSIF). Although TIF clearly outperforms the existing formulation for the problem, TSIF is capable of producing much stronger bounds in practice. The latter also enables us to develop an efficient column-generation (CG) algorithm. The pricing subproblem corresponds to a resource-constrained shortest path problem that is solved using a bucket graph–based labeling algorithm. The solutions of such a subproblem may contain cycles (reprocessing of jobs), and thus, a memory mechanism called dynamic arc-based ng-sets is employed in the labeling with a view toward avoiding some of them. Moreover, we also implement a preprocessing scheme based on Lagrangian relaxation to perform variable fixing. Extensive computational experiments were carried out in 810 benchmark instances. The proposed CG algorithm is capable of solving instances with up to 100 jobs to optimality. In addition, we believe that this is the first exact approach for a TWT batch-scheduling variant capable of systematically solving instances with up to 50 jobs. High-quality results are also reported for three special cases of the problem—more precisely, when (i) the penalty weights are unitary, (ii) there are no release dates, and (iii) all due dates are set to zero and, hence, the objective becomes equivalent to minimizing the weighted completion time. Summary of Contribution: This paper provides the first exact algorithm for a standard variant of a batch-scheduling total weighted tardiness problem that can solve instances with up to 100 jobs to optimality, a considerable leap with respect to previous works. In particular, we propose a time-indexed formulation that has the advantage of being relatively simple to implement, and yet we show that it is not theoretically dominated by the other innovative formulation proposed in the paper referred to as the time-size-indexed formulation (TSIF). Moreover, we present a Lagrangian approach to quickly fix variables and an iterative column-generation (CG) procedure over a Dantzig–Wolfe decomposition of TSIF that combines an efficient pricing algorithm with a dynamic scheme to adjust the subproblem constraints. The proposed CG approach is capable of producing very strong bounds for the problem as well as for some of its special cases." @default.
• W4207026062 created "2022-01-26" @default.
• W4207026062 creator A5000013261 @default.
• W4207026062 creator A5005419764 @default.
• W4207026062 creator A5008480636 @default.
• W4207026062 creator A5086775917 @default.
• W4207026062 date "2022-05-01" @default.
• W4207026062 modified "2023-10-18" @default.
• W4207026062 title "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling" @default.
• W4207026062 cites W1963645413 @default.
• W4207026062 cites W1965032790 @default.
• W4207026062 cites W1966523365 @default.
• W4207026062 cites W1966693694 @default.
• W4207026062 cites W1971129425 @default.
• W4207026062 cites W1974873411 @default.
• W4207026062 cites W1975448109 @default.
• W4207026062 cites W1978018515 @default.
• W4207026062 cites W1984396063 @default.
• W4207026062 cites W1994027672 @default.
• W4207026062 cites W1995082853 @default.
• W4207026062 cites W1995270512 @default.
• W4207026062 cites W1995415305 @default.
• W4207026062 cites W1998863535 @default.
• W4207026062 cites W2003566225 @default.
• W4207026062 cites W2007597483 @default.
• W4207026062 cites W2010137231 @default.
• W4207026062 cites W2010391827 @default.
• W4207026062 cites W2020603302 @default.
• W4207026062 cites W2021261368 @default.
• W4207026062 cites W2028945030 @default.
• W4207026062 cites W2034279788 @default.
• W4207026062 cites W2039823842 @default.
• W4207026062 cites W2048631059 @default.
• W4207026062 cites W2050014122 @default.
• W4207026062 cites W2060552317 @default.
• W4207026062 cites W2069703649 @default.
• W4207026062 cites W2070037973 @default.
• W4207026062 cites W2074055219 @default.
• W4207026062 cites W2076023255 @default.
• W4207026062 cites W2078533235 @default.
• W4207026062 cites W2087560807 @default.
• W4207026062 cites W2119007927 @default.
• W4207026062 cites W2129359183 @default.
• W4207026062 cites W2135480108 @default.
• W4207026062 cites W2136186989 @default.
• W4207026062 cites W2139982839 @default.
• W4207026062 cites W2159152246 @default.
• W4207026062 cites W2201915266 @default.
• W4207026062 cites W2394970205 @default.
• W4207026062 cites W2554975820 @default.
• W4207026062 cites W2557704169 @default.
• W4207026062 cites W2625859466 @default.
• W4207026062 cites W2743045177 @default.
• W4207026062 cites W2746461828 @default.
• W4207026062 cites W2786994071 @default.
• W4207026062 cites W2790488300 @default.
• W4207026062 cites W2902690130 @default.
• W4207026062 cites W3006185376 @default.
• W4207026062 cites W3089652464 @default.
• W4207026062 cites W3105385273 @default.
• W4207026062 cites W3175546025 @default.
• W4207026062 cites W4250901523 @default.
• W4207026062 doi "https://doi.org/10.1287/ijoc.2021.1133" @default.
• W4207026062 hasPublicationYear "2022" @default.
• W4207026062 type Work @default.
• W4207026062 citedByCount "2" @default.
• W4207026062 countsByYear W42070260622022 @default.
• W4207026062 crossrefType "journal-article" @default.
• W4207026062 hasAuthorship W4207026062A5000013261 @default.
• W4207026062 hasAuthorship W4207026062A5005419764 @default.
• W4207026062 hasAuthorship W4207026062A5008480636 @default.
• W4207026062 hasAuthorship W4207026062A5086775917 @default.
• W4207026062 hasConcept C109718341 @default.
• W4207026062 hasConcept C111919701 @default.
• W4207026062 hasConcept C11413529 @default.
• W4207026062 hasConcept C126255220 @default.
• W4207026062 hasConcept C13280743 @default.
• W4207026062 hasConcept C154945302 @default.
• W4207026062 hasConcept C15744967 @default.
• W4207026062 hasConcept C168956720 @default.
• W4207026062 hasConcept C185798385 @default.
• W4207026062 hasConcept C205649164 @default.
• W4207026062 hasConcept C206729178 @default.
• W4207026062 hasConcept C25360446 @default.
• W4207026062 hasConcept C2776029896 @default.
• W4207026062 hasConcept C2776435737 @default.
• W4207026062 hasConcept C2778047078 @default.
• W4207026062 hasConcept C33923547 @default.
• W4207026062 hasConcept C34736171 @default.
• W4207026062 hasConcept C41008148 @default.
• W4207026062 hasConcept C55416958 @default.
• W4207026062 hasConcept C56086750 @default.
• W4207026062 hasConcept C68387754 @default.
• W4207026062 hasConcept C77805123 @default.
• W4207026062 hasConcept C91765299 @default.
• W4207026062 hasConceptScore W4207026062C109718341 @default.
• W4207026062 hasConceptScore W4207026062C111919701 @default.
• W4207026062 hasConceptScore W4207026062C11413529 @default.

• next