Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Batch scheduling in a two-stage flexible flow shop problem
EN
We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines.
2
Content available remote Scheduling and due-date assignment problems with job rejection
EN
Scheduling with rejection reflects a very common scenario, where the scheduler may decide not to process a job if it is not profitable. We study the option of rejection in several popular and well-known scheduling and due-date assignment problems. A number of settings are considered: due-date and due-window assignment problems with job-independent costs, a due-date assignment problem with job-dependent weights and unit jobs, minimum total weighted earliness and tardiness cost with job-dependent and symmetric weights (known as TWET), and several classical scheduling problems (minimum makespan, flow-time, earliness-tardiness) with position-dependent processing times. All problems (excluding TWET) are shown to have a polynomial time solution. For the (NP-hard) TWET, a pseudo-polynomial time dynamic programming algorithm is introduced and tested numerically.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.