Obserwuj
Hans Ziegler
Hans Ziegler
Zweryfikowany adres z uni-passau.de
Tytuł
Cytowane przez
Cytowane przez
Rok
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
C Rajendran, H Ziegler
European Journal of Operational Research 155 (2), 426-438, 2004
6142004
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
C Rajendran, H Ziegler
European Journal of Operational Research 103 (1), 129-138, 1997
2131997
Impact of human resource management practices on employee turnover intentions: Moderating role of psychological contract breach
N Santhanam, K TJ, L Dyaram, H Ziegler
Journal of Indian Business Research 9 (3), 212-228, 2017
1442017
Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times
C Rajendran, H Ziegler
European Journal of Operational Research 149 (3), 513-522, 2003
1062003
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops
C Rajendran, H Ziegler
Computers & Industrial Engineering 48 (4), 789-797, 2005
992005
A comparison of heuristic algorithms for cost-oriented assembly line balancing
O Rosenberg, H Ziegler
Zeitschrift für Operations Research 36, 477-495, 1992
901992
An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs
Y Gajpal, C Rajendran, H Ziegler
The international journal of advanced manufacturing technology 30, 416-424, 2006
752006
Examining the moderating effects of organizational identification between human resource practices and employee turnover intentions in Indian hospitality industry
N Santhanam, TJ Kamalanabhan, L Dyaram, H Ziegler
GSTF Journal on Business Review (GBR) 4 (1), 11 - 19, 2015
582015
Solving Certain Singly Constrained Convex Optimization Problems in Production Planning
H Ziegler
Operations Research Letters 1, 246 - 252, 1982
571982
A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs
C Rajendran, H Ziegler
Computers & Industrial Engineering 33 (1-2), 281-284, 1997
461997
Heuristics for scheduling in a flowshop with setup, processing and removal times separated
C Rajendran, H Ziegler
Production Planning & Control 8 (6), 568-576, 1997
441997
A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
C Rajendran, H Ziegler
European Journal of Operational Research 131 (3), 622-634, 2001
422001
Improving job shop performance by coordinating dispatching rules
O Holthaus, H Ziegler
International Journal of Production Research 35 (2), 539-549, 1997
411997
Improving job shop performance by coordinating dispatching rules
O Holthaus, H Ziegler
PROCEEDINGS-SPIE THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING, 218-218, 1995
411995
The value of information sharing in a serial supply chain with AR (1) demand and non-zero replenishment lead times
D Sabitha, C Rajendran, S Kalpakam, H Ziegler
European Journal of Operational Research 255 (3), 758-777, 2016
382016
Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs
C Rajendran, H Ziegler
Computers & Industrial Engineering 37 (4), 671-690, 1999
321999
Age dependent perishability in two-echelon serial inventory systems
LL Abdel-Malek, H Ziegler
Computers & Operations Research 15 (3), 227-238, 1988
281988
A multi-objective ant-colony algorithm for permutation flowshop scheduling to minimize the makespan and total flowtime of jobs
C Rajendran, H Ziegler
Computational Intelligence in Flow Shop and Job Shop Scheduling, 53-99, 2009
202009
Capacitated lot-sizing problem with production carry-over and set-up splitting: mathematical models
R Ramya, C Rajendran, H Ziegler
International Journal of Production Research 54 (8), 2332-2344, 2016
192016
Capacitated lot sizing problems in process industries
R Ramya, C Rajendran, H Ziegler, S Mohapatra, K Ganesh
Springer, 2019
182019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20