( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs.

, , и . Ann. Oper. Res., (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

V Geoffroy

V Saile

V Ustinov

V Adams

V Fendrich

 

Другие публикации лиц с тем же именем

Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates., и . J. Glob. Optim., 27 (2-3): 293-311 (2003)Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach., , и . ESA, том 5193 из Lecture Notes in Computer Science, стр. 756-767. Springer, (2008)Affinity-aware resource provisioning for long-running applications in shared clusters., , , , , , и . J. Parallel Distributed Comput., (июля 2023)Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem., и . Eur. J. Oper. Res., 165 (2): 444-456 (2005)Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines., , и . INFORMS J. Comput., 28 (1): 148-161 (2016)Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times., и . Algorithmica, 51 (4): 451-473 (2008)NP-hardness of Shop-scheduling Problems with Three Jobs., и . Discret. Appl. Math., 59 (3): 237-266 (1995)Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches., , и . Eur. J. Oper. Res., 266 (3): 795-818 (2018)Minimising the number of gap-zeros in binary matrices., , и . Eur. J. Oper. Res., 229 (1): 48-58 (2013)A polynomial-time algorithm for a flow-shop batching problem with equal-length operations., и . J. Sched., 14 (4): 371-389 (2011)