Browse by Journal Title

Group by: Creators | Item Type | Uncontrolled Keywords | No Grouping

approximation approximation algorithm assembly scheduling problem assignment problem batch availability batching Branch-and-bound bullwhip effect closed-loop supply chains Combinatorial optimization common due date assignment complexity Container terminals data envelopment analysis Data mining distribution supply chain flexibility flow shop Flows in networks FPTAS fuzzy sets fuzzy two-level optimisation Geometric rounding Half-Product Import containers incompatibility graph inventory control job deterioration job shop job shop scheduling K -approximation sets and functions logic-based Benders decomposition Machine learning machine non-availability makespan max-batch mixture of job and open shops Non-linear boolean programming non-shared resources nonlinear dynamics NP-hard problem open shop open shop scheduling optimal scheduling Optimization with submodular constraints order assignment and scheduling parallel dedicated machines parallel machines polynomial algorithm positional effects positionally dependent processing times production technology production trade-offs push and pull production quadratic knapsack ratio inputs and outputs Regression trees Remanufactured products robustness scheduling scheduling with controllable processing times Scheduling with imprecise computation scheduling with rejection secondary schools single machine single machine scheduling SLK due date assignment stochastic optimization system dynamics tardiness total weighted completion time two machine scheduling uncertainty worst-case analysis

Number of items: 88.

approximation

Kelleler, H. and Strusevich, V.A. (2002) Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research, 147 (2). pp. 345-364. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(02)00246-1)

Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157 (3). pp. 620-642. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(03)00250-9)

approximation algorithm

Drobouchevitch, I.G. and Strusevich, V.A. (2000) Heuristics for the two-stage job shop scheduling problem with a bottleneck machine. European Journal of Operational Research, 123 (2). pp. 229-240. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(99)00253-2)

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (2001) Two-stage open shop scheduling with a bottleneck machine. European Journal of Operational Research, 128 (1). pp. 159-174. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(99)00356-2)

Kellerer, Hans, Kubzin, Mikhail A. and Strusevich, Vitaly A. (2009) Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. European Journal of Operational Research, 199 (1). pp. 111-116. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2008.11.003)

assembly scheduling problem

assignment problem

Rustogi, Kabir and Strusevich, Vitaly A. (2012) Simple matching vs linear assignment in scheduling models with positional effects: A critical review. European Journal of Operational Research, 222 (3). pp. 393-407. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2012.04.037)

batch availability

batching

Branch-and-bound

Silva, Marcos de Melo da, Erdoğan, Güneş, Battarra, Maria and Strusevich, Vitaly (2017) The block retrieval problem. European Journal of Operational Research, 265 (3). pp. 931-950. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2017.08.048)

bullwhip effect

Lin, Junyi, Zhou, Li ORCID: 0000-0001-7132-5935 , Spiegler, Virginia L.M, Naim, Mohamed M. and Syntetos, Aris (2021) Push or pull? The impact of ordering policy choice on the dynamics of a hybrid closed-loop supply chain. European Journal of Operational Research, 300 (1). pp. 282-295. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2021.10.031)

closed-loop supply chains

Combinatorial optimization

Halman, Nir, Kellerer, Hans and Strusevich, Vitaly A. (2018) Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints. European Journal of Operational Research, 270 (2). pp. 435-447. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2018.04.013)

common due date assignment

Gordon, Valery S. and Strusevich, Vitaly A. (2009) Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research, 198 (1). pp. 57-62. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2008.07.044)

complexity

Container terminals

data envelopment analysis

Podinovski, Victor V., Wu, Junlin and Argyris, Nikolaos ORCID: 0000-0001-9555-0758 (2023) Production trade-offs in models of data envelopment analysis with ratio inputs and outputs: an application to schools in England. European Journal of Operational Research. pp. 1-14. ISSN 0377-2217 (Print), 1872-6860 (Online) (doi:https://doi.org/10.1016/j.ejor.2023.08.019)

Data mining

Van Nguyen, Truong, Zhou, Li ORCID: 0000-0001-7132-5935 , Chong, Alain Yee, Li, Boying and Pu, Xiaodie (2019) Predicting customer demand for remanufactured products: A data-mining approach. European Journal of Operational Research, 281 (3). pp. 543-558. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2019.08.015)

distribution supply chain

Petrovic, Dobrila, Xie, Ying, Burnham, Keith and Petrovic, Radivoj (2008) Coordinated control of distribution supply chains in the presence of fuzzy customer demand. European Journal of Operational Research, 185 (1). pp. 146-158. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2006.12.020)

flexibility

Esswein, Carl, Billaut, Jean-Charles and Strusevich, Vitaly A. (2005) Two-machine shop scheduling: Compromise between flexibility and makespan value. European Journal of Operational Research, 167 (3). pp. 796-809. ISSN 0377-2217 (Print), 0377-2217 (Online) (doi:https://doi.org/10.1016/j.ejor.2004.01.029)

flow shop

Flows in networks

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly (2017) Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. European Journal of Operational Research, 266 (3). pp. 795-818. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2017.08.034)

FPTAS

Kellerer, Hans and Strusevich, Vitaly (2013) Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. European Journal of Operational Research, 228 (1). pp. 24-32. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2012.12.028)

fuzzy sets

fuzzy two-level optimisation

Geometric rounding

Half-Product

Import containers

incompatibility graph

Lushchakova, Irina N. and Strusevich, Vitaly A. (2010) Scheduling incompatible tasks on two machines. European Journal of Operational Research, 200 (2). pp. 334-346. (doi:https://doi.org/10.1016/j.ejor.2009.01.029)

inventory control

job deterioration

job shop

job shop scheduling

K -approximation sets and functions

logic-based Benders decomposition

Li, Yantong, Cote, Jean-Francois, Coelho, Leandro, Zhang, Chuang and Zhang, Shuai ORCID: 0000-0002-9796-058X (2022) Order assignment and scheduling under processing and distribution time uncertainty. European Journal of Operational Research, 305 (1). pp. 148-163. ISSN 0377-2217 (Print), 1872-6860 (Online) (doi:https://doi.org/10.1016/j.ejor.2022.05.033)

Machine learning

machine non-availability

makespan

max-batch

mixture of job and open shops

Shakhlevich, Natalia V., Sotskov, Yuri N. and Werner, Frank (2000) Complexity of mixed shop scheduling problems: A survey. European Journal of Operational Research, 120. pp. 343-351. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(99)00161-7)

Export as	RSS