Showing 1 - 10 of 1,028
needed or enable setups concurrent with production. A production plan comprises the sequencing of coils and the scheduling of … for this integrated sequencing and scheduling problem. A core component is a graph theoretical model for concurrent setup … scheduling. It is instrumental for building a fast heuristic that is embedded into a genetic algorithm to solve the sequencing …
Persistent link: https://www.econbiz.de/10009214379
We present a novel generic programming implementation of a column-generation algorithm for the generalized staff rostering problem. The problem is represented as a generalized set partitioning model, which is able to capture commonly occurring problem characteristics given in the literature....
Persistent link: https://www.econbiz.de/10010666133
In this paper we consider timetable design at a European freight railway operator. The timetable is designed by choosing the time of service for customer unit train demands among a set of discrete points. These discrete points are all found within the a time-window. The objective of the model is...
Persistent link: https://www.econbiz.de/10011077620
We address a single machine family scheduling problem where jobs are partitioned into families and setup time is …
Persistent link: https://www.econbiz.de/10010883654
In real world scheduling systems, task or job attributes are stochastic and sequence dependent, learning improves … paper addresses a stochastic bicriteria single machine scheduling problem wherein processing times, setup times, and …
Persistent link: https://www.econbiz.de/10010944887
We study various two-agent scheduling problems on a single machine with equal job processing times. The equal …
Persistent link: https://www.econbiz.de/10011209382
We investigate the single machine scheduling problem with job release dates and due dates, and multiple planned … unavailability time periods. This problem arises in the context of machine scheduling with planned preventive maintenance and might …-fold. First, we propose a new lower bound that is based on the concept of semi-preemptive scheduling. Second, we propose an exact …
Persistent link: https://www.econbiz.de/10011266509
In this paper a one-machine scheduling model is analyzed where [TeX: $n$] different jobs are classified into [TeX: $K …
Persistent link: https://www.econbiz.de/10010837729
This paper deals with a single machine scheduling problem with general past-sequence-dependent (psd) setup time and log …
Persistent link: https://www.econbiz.de/10010667473
In this paper, the dynamic single-machine scheduling problem with a sequence-dependent setup time and with minimising …
Persistent link: https://www.econbiz.de/10010670133