Similar Search Results

Scheduling deteriorating jobs dependent on resources for the makespan minimization

Bachman, Aleksander; Janiak, Adam - In: Operations research proceedings 2000 : selected papers …, (pp. 29-34). 2001

Persistent link: https://www.econbiz.de/10001571404

Some single machine scheduling problems with resource dependent set-up and processing times

Janiak, Adam; Lichtenstein, Maciej - In: Operations research proceedings 2000 : selected papers …, (pp. 60-64). 2001

Persistent link: https://www.econbiz.de/10001571417

Scheduling jobs with decreasing processing times for the total completion time minimization

Bachman, Aleksander; Janiak, Adam - In: Operations research proceedings 2000 : selected papers …, (pp. 353-358). 2001

Persistent link: https://www.econbiz.de/10001571653

Comparison of some heuristic algorithms for the flow shop problem with parallel machines to minimize the total earliness, tardiness and waiting time

Janiak, Adam; Lichtenstein, Maciej - In: Operations research proceedings 2000 : selected papers …, (pp. 378-383). 2001

Persistent link: https://www.econbiz.de/10001571664

A note on a makespan minimization problem with a multi-ability learning effect

Janiak, Adam; Rudek, Radosław - In: Omega : the international journal of management science 38 (2009/10) 3/4, pp. 213-217

Persistent link: https://www.econbiz.de/10003948067

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

Dereniowski, Dariusz; Kubiak, Wieslaw - In: Journal of scheduling 13 (2010) 5, pp. 479-492

Persistent link: https://www.econbiz.de/10008699007

Scheduling semi-malleable jobs to minimize mean flow time

Hendel, Yann; Kubiak, Wieslaw; Trystram, Denis - In: Journal of scheduling 18 (2015) 4, pp. 335-343

Persistent link: https://www.econbiz.de/10011308070

Earliness-Tardiness Scheduling Problems, II : Deviation of Completion Times About a Restrictive Common Due Date

Hall, Nicholas G. - 2017

A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of...

Persistent link: https://www.econbiz.de/10012746786

On the complexity of open shop scheduling with time lags

Kubiak, Wieslaw - In: Journal of scheduling : JOS 26 (2023) 3, pp. 331-334

Persistent link: https://www.econbiz.de/10014326190

Normal-form preemption sequences for an open problem in scheduling theory

Chen, Bo; Coffman, Edward G.; Dereniowski, Dariusz; … - In: Journal of scheduling 19 (2016) 6, pp. 701-728

Persistent link: https://www.econbiz.de/10011645864