Similar Search Results

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization

Cordone, Roberto; Hosteins, Pierre - In: Computers & operations research : and their … 102 (2019), pp. 130-140

Persistent link: https://www.econbiz.de/10011948021

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

Bosio, Alberto; Righini, Giovanni - In: Computational Statistics 69 (2009) 2, pp. 271-280

We consider a scheduling problem in which the processing time of each job deteriorates, i.e. it increases as time passes after the release date of the job. We present a dynamic programming algorithm coupled with upper bounding and lower bounding techniques to compute exact solutions. We report...

Persistent link: https://www.econbiz.de/10010847912

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

Bosio, Alberto; Righini, Giovanni - In: Mathematical Methods of Operations Research 69 (2009) 2, pp. 271-280

Persistent link: https://www.econbiz.de/10010950299

A column generation algorithm for the vehicle routing problem with soft time windows

Liberatore, Federico; Righini, Giovanni; Salani, Matteo - In: 4OR : a quarterly journal of operations research 9 (2011) 1, pp. 49-82

Persistent link: https://www.econbiz.de/10008992031

A pricing algorithm for the Vehicle Routing Problem with Soft Time Windows

Liberatore, Federico; Righini, Giovanni; Salani, Matteo - In: Innovations in distribution logistics, (pp. 251-266). 2009

Persistent link: https://www.econbiz.de/10003841692

Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming

Righini, Giovanni; Salani, Matteo - In: Computers & operations research : and their … 36 (2009) 4, pp. 1191-1203

Persistent link: https://www.econbiz.de/10003827782

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

Bosio, Alberto; Righini, Giovanni - In: Mathematical methods of operations research 69 (2009) 2, pp. 271-280

Persistent link: https://www.econbiz.de/10003858145

A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies

Ceselli, Alberto; Felipe, Ángel; Ortuño, M. Teresa; … - In: Operations research forum 2 (2021) 1, pp. 1-33

Persistent link: https://www.econbiz.de/10012433412

Optimally rescheduling jobs with a Last-In-First-Out buffer

Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich; … - In: Journal of scheduling : JOS 24 (2021) 6, pp. 663-680

Persistent link: https://www.econbiz.de/10012792459

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs

Pferschy, Ulrich; Resch, Julia; Righini, Giovanni - In: Journal of scheduling : JOS 26 (2023) 3, pp. 267-287

Persistent link: https://www.econbiz.de/10014326138