Result 1 to 20 from 87 total
Two-agent scheduling on an unbounded serial batching machine. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 427-438 (2012).
1
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. (English)
Discrete Optim. 9, No. 1, 29-39 (2012).
2
Scheduling an unbounded batching machine with job processing time compatibilities. (English)
Discrete Appl. Math. 160, No. 1-2, 15-23 (2012).
3
Minimizing the number of late jobs on a single machine under due date uncertainty. (English)
J. Sched. 14, No. 4, 351-360 (2011).
4
The simplified partial digest problem: approximation and a graph-theoretic model. (English)
Eur. J. Oper. Res. 208, No. 2, 142-152 (2011).
5
Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary. (English)
Autom. Remote Control 71, No. 10, 2021-2028 (2010); translation from Avtom. Telemekh. 2010, No. 10, 6-14 (2010).
6
A generic approach to proving NP-hardness of partition type problems. (English)
Discrete Appl. Math. 158, No. 17, 1908-1912 (2010).
7
“Product partition” and related problems of scheduling and systems reliability: computational complexity and approximation. (English)
Eur. J. Oper. Res. 207, No. 2, 601-604 (2010).
8
Internet shopping optimization problem. (English)
Int. J. Appl. Math. Comput. Sci. 20, No. 2, 385-390 (2010).
9
Minimizing total completion time on a batching machine with job processing time compatibilities (English)
Electronic Notes in Discrete Mathematics 36, 1295-1302 (2010).
10
Internet shopping optimization problem (English)
Applied Mathematics and Computer Science 20, No. 2, 385-390 (2010).
11
On the approximability of the simplified partial digest problem. (English)
Discrete Appl. Math. 157, No. 17, 3586-3592 (2009).
12
Elementary combinatorial-probabilistic proof of the Wallis and Stirling formulas. (English)
J. Math. Stat. 5, No. 4, 408-410 (2009).
13
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. (English)
Discrete Appl. Math. 157, No. 8, 1806-1824 (2009).
14
An FPTAS for a supply scheduling problem with non-monotone cost functions. (English)
Nav. Res. Logist. 55, No. 3, 194-199 (2008).
15
Batch scheduling of step deteriorating jobs. (English)
J. Sched. 11, No. 1, 17-28 (2008).
16
Lot-sizing and sequencing on a single imperfect machine. (English)
Le Thi, Hoai An (ed.) et al., Modelling, computation and optimization in information systems and management sciences. Second international conference MCO 2008, Metz, France - Luxembourg, September 8‒10, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87476-8/pbk). Communications in Computer and Information Science 14, 117-125 (2008).
17
Group sequencing around a common due date. (English)
Discrete Optim. 5, No. 3, 594-604 (2008).
18
Scheduling jobs in a contaminated area: a model and heuristic algorithms. (English)
J. Oper. Res. Soc. 59, No. 7, 977-987 (2008).
19
Batch scheduling of deteriorating reworkables. (English)
Eur. J. Oper. Res. 189, No. 3, 1317-1326 (2008).
20
Result 1 to 20 from 87 total
Start
Contact
Print
General Help
