Browse by Journal Title

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

approximation scheme batching bicriteria problems controllable processing times cumulative effect deteriorating jobs deterioration due date assignment flow shop flow shop scheduling flowshop scheduling greedy algorithms Half-Product Problem job shop learning learning effect maintenance maintenance activity mathematical analyses minimum makespan Minsk Group mixed graph multiple criteria NP-hard open shop parallel machine scheduling parametric decomposition permutation polymatroids polynomial algorithm positional effect power of preemption Precedence constraints precedence constraints priority-generating function priority-generating functions quality of a single preemption scheduling sequencing single machine single machine scheduling subset-sum problem symmetric function total completion time unrelated parallel machines V-shaped V-shaped Vyacheslav S. Tanaev Vyacheslav Tanaev weighted completion time

Number of items: 65.

approximation scheme

Kellerer, Hans, Rustogi, Kabir and Strusevich, Vitaly A. (2012) Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. Journal of Scheduling, 16 (6). pp. 675-683. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-012-0287-8)

Rustogi, Kabir and Strusevich, Vitaly A. (2016) Single machine scheduling with a generalized job-dependent cumulative effect. Journal of Scheduling, 20 (6). pp. 583-592. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-016-0497-6)

batching

Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)

bicriteria problems

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2005) Pre-emptive scheduling problems with controllable processing times. Journal of Scheduling, 8 (3). pp. 233-253. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-005-6813-1)

controllable processing times

Cheng, T.C. Edwin and Shakhlevich, Natalia (1999) Proportionate flow shop with controllable processing times. Journal of Scheduling, 2 (6). pp. 253-265. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1002/(SICI)1099-1425(199911/12)2:6<253::AID-JOS30>3.0.CO;2-R)

cumulative effect

Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly (2019) Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects. Journal of Scheduling, 23 (6). pp. 665-680. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-019-00628-4)

deteriorating jobs

Gordon, V.S., Potts, C.N., Strusevich, V.A. and Whitehead, J.D. (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Journal of Scheduling, 11 (5). pp. 357-370. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-008-0064-x)

deterioration

Gordon, Valerie, Strusevich, Vitaly and Dolgui, Alexandre (2011) Scheduling with due date assignment under special conditions on job processing. Journal of Scheduling, 15 (4). pp. 447-456. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-011-0240-2)

due date assignment

flow shop

Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 (2015) A cyclical search for the two machine flow shop and open shop to minimise finishing time. Journal of Scheduling, 18 (3). pp. 311-314. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-013-0356-7)

flow shop scheduling

Shakhlevich, Natalia, Hoogeveen, Han and Pinedo, Michael (1998) Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1 (3). pp. 157-168. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y)

flowshop scheduling

greedy algorithms

Half-Product Problem

job shop

learning

learning effect

maintenance

maintenance activity

mathematical analyses

Blazewicz, Jacek, Burke, Edumnd K., Gordon, Valery S., Kovalyov, Mikhail Y., Shafransky, Yakov M. and Strusevich, Vitaly A. (2011) Editorial: new branches, old roots. Journal of Scheduling, 15 (4). pp. 399-401. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-011-0262-9)

minimum makespan

Minsk Group

Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-011-0230-4)

mixed graph

multiple criteria

NP-hard

open shop

parallel machine scheduling

parametric decomposition

permutation

polymatroids

polynomial algorithm

positional effect

power of preemption

Soper, Alan ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly (2022) Preemptive and non-preemptive scheduling on two unrelated parallel machines. Journal of Scheduling, 2022. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-022-00753-7)