The SCEAS System
| |||||||

## Search the dblp DataBase
Gur Mosheiov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Motty Birman, Gur Mosheiov
**A note on a due-date assignment on a two-machine flow-shop.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2004, v:31, n:3, pp:473-480 [Journal] - Avital Lann, Gur Mosheiov
**A note on the maximum number of on-time jobs on parallel identical machines.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2003, v:30, n:11, pp:1745-1749 [Journal] - Avital Lann, Gur Mosheiov
**Single machine scheduling to minimize the number of early and tardy jobs.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1996, v:23, n:8, pp:769-781 [Journal] - Micha Mandel, Gur Mosheiov
**Minimizing maximum earliness on parallel identical machines.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2001, v:28, n:4, pp:317-327 [Journal] - Gur Mosheiov
**A common due-date assignment problem on parallel identical machines.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2001, v:28, n:8, pp:719-732 [Journal] - Gur Mosheiov
**Scheduling jobs under simple linear deterioration.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1994, v:21, n:6, pp:653-659 [Journal] - Gur Mosheiov, Daniel Oron
**A note on the SPT heuristic for solving scheduling problems with generalized due dates.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2004, v:31, n:5, pp:645-655 [Journal] - Gur Mosheiov
**Complexity analysis of job-shop scheduling with deteriorating jobs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:195-209 [Journal] - Gur Mosheiov, Daniel Oron
**Single machine scheduling with batch-dependent setup times.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:98, n:2, pp:73-78 [Journal] - Avital Lann, Gur Mosheiov, Yosef Rinott
**Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1998, v:22, n:2-3, pp:63-68 [Journal] - Gur Mosheiov, Daniel Oron, Yaacov Ritov
**Minimizing flow-time on a single machine with integer batch sizes.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2005, v:33, n:5, pp:497-501 [Journal] - Gur Mosheiov, Uri Yovel
**Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:172, n:2, pp:528-544 [Journal] - Gur Mosheiov, Daniel Oron
**Minmax scheduling with job-classes and earliness-tardiness costs.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:177, n:1, pp:612-622 [Journal] - Gur Mosheiov, Daniel Oron
**A note on flow-shop and job-shop batch scheduling with identical processing-time jobs.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:161, n:1, pp:285-291 [Journal] - Gur Mosheiov
**Minimizing total completion time and total deviation of job completion times from a restrictive due-date.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:165, n:1, pp:20-33 [Journal] - Gur Mosheiov
**Simultaneous minimization of total completion time and total deviation of job completion times.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:157, n:2, pp:296-306 [Journal] - Gur Mosheiov, Uri Yovel
**Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job".**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:157, n:1, pp:257-261 [Journal] - Gur Mosheiov, Jeffrey B. Sidney
**Scheduling with general job-dependent learning curves.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:147, n:3, pp:665-670 [Journal] **An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs.**[Citation Graph (, )][DBLP]**Minmax scheduling problems with a common due-window.**[Citation Graph (, )][DBLP]**A note: Simple heuristics for scheduling a maintenance activity on unrelated machines.**[Citation Graph (, )][DBLP]**Scheduling a maintenance activity and due-window assignment on a single machine.**[Citation Graph (, )][DBLP]**The Browne-Yechiali single-machine sequence is optimal for flow-shops.**[Citation Graph (, )][DBLP]
Search in 0.000secs, Finished in 0.001secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |