Narrow search
Showing 1 - 10 of 2,411
Cover Image
Verfahren zur Lösung des ressourcenbeschränkten Projektdauerminimierungsproblems mit planungsabhängigen Zeitfenstern
Schwindt, Christoph - 1998 - Als Ms. gedr.
Persistent link: https://www.econbiz.de/10004362822
Cover Image
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne; Gupta, Jatinder N.D.; Herrmann, Jan - In: European Journal of Operational Research 243 (2015) 2, pp. 514-522
parallel machines where jobs can only be delivered at certain fixed delivery dates. Scheduling problems with fixed delivery … using either an efficient mathematical programming formulation or a branch-and-bound algorithm. Consequently, we develop a … tabu search and a hybrid genetic algorithm to quickly find good approximate solutions for larger instances. …
Persistent link: https://www.econbiz.de/10011209377
Cover Image
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
Prot, D.; Bellenguez-Morineau, O.; Lahlou, C. - In: European Journal of Operational Research 231 (2013) 2, pp. 282-287
In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in …
Persistent link: https://www.econbiz.de/10010682506
Cover Image
Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships
Rossi, Andrea - In: International Journal of Production Economics 153 (2014) C, pp. 253-267
(anticipatory) setup times. It involves separable sequence-independent and dependent setup phases. The algorithm performance is … evaluated by modifying the well-known benchmark problems for job shop scheduling. Comparison with other systems and lower bounds …
Persistent link: https://www.econbiz.de/10010776679
Cover Image
A polynomial algorithm for P | p<Subscript>j</Subscript>=1, r<Subscript>j</Subscript>, outtree | ∑ C<Subscript>j</Subscript>
Brucker, Peter; Hurink, Johann; Knust, Sigrid - In: Mathematical Methods of Operations Research 56 (2003) 3, pp. 407-412
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs …
Persistent link: https://www.econbiz.de/10010999571
Cover Image
A polynomial algorithm for P | p j=1, r j, outtree | ∑ C j
Brucker, Peter; Hurink, Johann; Knust, Sigrid - In: Computational Statistics 56 (2003) 3, pp. 407-412
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs …
Persistent link: https://www.econbiz.de/10010847527
Cover Image
Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms
Damodaran, Purushothaman; Hirani, Neal S.; … - In: European Journal of Industrial Engineering 3 (2009) 2, pp. 187-206
in the batch. Two interdependent decisions are required, namely grouping jobs into batches, and scheduling the batches on … the machines. The problem under study is NP-hard and hence a Genetic Algorithm (GA) approach is proposed. The … Random Keys Genetic Algorithm (RKGA), a Hybrid Genetic Heuristic (HGH) and a commercial solver. The proposed GA approach was …
Persistent link: https://www.econbiz.de/10005078473
Cover Image
A hybrid CP/MILP method for scheduling with energy costs
Haït, Alain; Artigues, Christian - In: European Journal of Industrial Engineering 5 (2011) 4, pp. 471-489
This paper deals with energy-related job scheduling for a foundry, in order to minimise the electricity bill …
Persistent link: https://www.econbiz.de/10009352906
Cover Image
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi; Chen, Yong; Zhang, An - In: International Journal of Production Economics 146 (2013) 1, pp. 293-299
This paper considers the scheduling problems with the objective of minimizing the total completion time on two parallel …, which is the smallest possible worst-case ratio that an polynomial time algorithm can have unless P=NP. …
Persistent link: https://www.econbiz.de/10010869077
Cover Image
Optimisation of sequencing and scheduling in hybrid flow shop environment using heuristic approach
Sridhar, S.; Prabaharan, T.; Saravanan, M. - In: International Journal of Logistics Economics and … 2 (2010) 4, pp. 331-351
This paper considers the hybrid flow shop scheduling problem. Most real world scheduling problems are NP-hard in nature … with 'k' stage is solved by Gantt chart method which gives an active feasible schedule. A simulated annealing algorithm is … proposed in this paper to find a better/optimal or near optimal schedule. This technique reveals that the proposed algorithm is …
Persistent link: https://www.econbiz.de/10010668814