Similar Search Results

Minimize total tardiness and machine unavailability on single machine scheduling problem : bi-objective branch and bound algorithm

Khoudi, Asmaa; Berrichi, Ali - In: Operational research : an international journal 20 (2020) 3, pp. 1763-1789

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

A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem

Álvarez-Miranda, Eduardo; Pereira, Jordi; Vilà, Mariona - In: Computers & operations research : an international journal 166 (2024), pp. 1-16

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

Nonsequential appointment scheduling with a random number of requests

Zhu, Yan; Liu, Zhixin; Qi, Xiangtong - In: Production and operations management : the flagship … 33 (2024) 1, pp. 184-204

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

An exact algorithm for the preemptive single machine scheduling of equal-length jobs

Fomin, Artem; Goldengorin, Boris - In: Computers & operations research : and their … 142 (2022), pp. 1-11

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

A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference

Dienstknecht, Michael - In: 4OR : quarterly journal of the Belgian, French and … 21 (2023) 1, pp. 105-123

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

Scheduling a single machine with multiple due dates per job

Kühn, Raphael; Weiß, Christian; Ackermann, Heiner; … - In: Journal of scheduling : JOS 27 (2024) 6, pp. 565-585

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

Solution algorithms for the number of tardy jobs minimisation scheduling with a time-dependent learning effect

Wang, Zhenyou; Wei, Cai-Min; Sun, Linhui - In: International journal of production research 55 (2017) 11/12, pp. 3141-3148

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

Minimizing earliness and tardiness costs in stochastic scheduling

Baker, Kenneth R. - In: European Journal of Operational Research 236 (2014) 2, pp. 445-452

We address the single-machine stochastic scheduling problem with an objective of minimizing total expected earliness and tardiness costs, assuming that processing times follow normal distributions and due dates are decisions. We develop a branch and bound algorithm to find optimal solutions to...

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

Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling

Franck, Birger; Neumann, Klaus; Schwindt, Christoph - In: OR-Spektrum : quantitative approaches in management 23 (2001) 3, pp. 297-324

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

The resource renting problem subject to temporal constraints

Nübel, Hartwig - In: OR-Spektrum : quantitative approaches in management 23 (2001) 3, pp. 359-381

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