Nonsequential appointment scheduling with a random number of requests
Yan Zhu, Zhixin Liu, Xiangtong Qi
| Year of publication: |
2024
|
|---|---|
| Authors: | Zhu, Yan ; Liu, Zhixin ; Qi, Xiangtong |
| Published in: |
Production and operations management : the flagship research journal of the Production and Operations Management Society. - London : Sage Publications, ISSN 1937-5956, ZDB-ID 2151364-8. - Vol. 33.2024, 1, p. 184-204
|
| Subject: | Appointment scheduling | dynamic | nonsequential | branch and bound | shortest path | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
Online Resource
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1177/10591478231224926 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10014575548