| 2009 |
|---|
| 24 | EE | Gur Mosheiov,
Assaf Sarig:
Minmax scheduling problems with a common due-window.
Computers & OR 36(6): 1886-1892 (2009) |
| 23 | EE | Gur Mosheiov,
Assaf Sarig:
Due-date assignment on uniform machines.
European Journal of Operational Research 193(1): 49-58 (2009) |
| 2008 |
|---|
| 22 | EE | Chung-Lun Li,
Gur Mosheiov,
Uri Yovel:
An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs.
Computers & OR 35(11): 3612-3619 (2008) |
| 21 | EE | Daniel Baraz,
Gur Mosheiov:
A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time.
European Journal of Operational Research 184(2): 810-813 (2008) |
| 20 | EE | Gur Mosheiov,
Daniel Oron:
A single machine batch scheduling problem with bounded batch size.
European Journal of Operational Research 187(3): 1069-1079 (2008) |
| 19 | EE | Gur Mosheiov,
Daniel Oron:
Open-shop batch scheduling with identical jobs.
European Journal of Operational Research 187(3): 1282-1292 (2008) |
| 2007 |
|---|
| 18 | EE | Gur Mosheiov,
Daniel Oron:
Minmax scheduling with job-classes and earliness-tardiness costs.
European Journal of Operational Research 177(1): 612-622 (2007) |
| 2006 |
|---|
| 17 | EE | Gur Mosheiov,
Uri Yovel:
Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs.
European Journal of Operational Research 172(2): 528-544 (2006) |
| 16 | EE | Gur Mosheiov,
Daniel Oron:
Single machine scheduling with batch-dependent setup times.
Inf. Process. Lett. 98(2): 73-78 (2006) |
| 2005 |
|---|
| 15 | EE | Gur Mosheiov,
Daniel Oron:
A note on flow-shop and job-shop batch scheduling with identical processing-time jobs.
European Journal of Operational Research 161(1): 285-291 (2005) |
| 14 | EE | Gur Mosheiov:
Minimizing total completion time and total deviation of job completion times from a restrictive due-date.
European Journal of Operational Research 165(1): 20-33 (2005) |
| 13 | EE | Gur Mosheiov,
Daniel Oron,
Yaacov Ritov:
Minimizing flow-time on a single machine with integer batch sizes.
Oper. Res. Lett. 33(5): 497-501 (2005) |
| 2004 |
|---|
| 12 | EE | Motty Birman,
Gur Mosheiov:
A note on a due-date assignment on a two-machine flow-shop.
Computers & OR 31(3): 473-480 (2004) |
| 11 | EE | Gur Mosheiov,
Daniel Oron:
A note on the SPT heuristic for solving scheduling problems with generalized due dates.
Computers & OR 31(5): 645-655 (2004) |
| 10 | EE | Gur Mosheiov,
Uri Yovel:
Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job".
European Journal of Operational Research 157(1): 257-261 (2004) |
| 9 | EE | Gur Mosheiov:
Simultaneous minimization of total completion time and total deviation of job completion times.
European Journal of Operational Research 157(2): 296-306 (2004) |
| 2003 |
|---|
| 8 | EE | Avital Lann,
Gur Mosheiov:
A note on the maximum number of on-time jobs on parallel identical machines.
Computers & OR 30(11): 1745-1749 (2003) |
| 7 | EE | Gur Mosheiov,
Jeffrey B. Sidney:
Scheduling with general job-dependent learning curves.
European Journal of Operational Research 147(3): 665-670 (2003) |
| 2002 |
|---|
| 6 | | Gur Mosheiov:
Complexity analysis of job-shop scheduling with deteriorating jobs.
Discrete Applied Mathematics 117(1-3): 195-209 (2002) |
| 2001 |
|---|
| 5 | EE | Micha Mandel,
Gur Mosheiov:
Minimizing maximum earliness on parallel identical machines.
Computers & OR 28(4): 317-327 (2001) |
| 4 | EE | Gur Mosheiov:
A common due-date assignment problem on parallel identical machines.
Computers & OR 28(8): 719-732 (2001) |
| 1998 |
|---|
| 3 | EE | Avital Lann,
Gur Mosheiov,
Yosef Rinott:
Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps.
Oper. Res. Lett. 22(2-3): 63-68 (1998) |
| 1996 |
|---|
| 2 | EE | Avital Lann,
Gur Mosheiov:
Single machine scheduling to minimize the number of early and tardy jobs.
Computers & OR 23(8): 769-781 (1996) |
| 1994 |
|---|
| 1 | EE | Gur Mosheiov:
Scheduling jobs under simple linear deterioration.
Computers & OR 21(6): 653-659 (1994) |
