Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times

Kaja Balzereit,Niels Grüttemeier,Nils Morawietz, Dennis Reinhardt,Stefan Windmann,Petra Wolf

Computing Research Repository (CoRR)（2024）

Cited 0|Views2

Abstract

In this work, we study the task of scheduling jobs on a single machine with sequence dependent family setup times under the goal of minimizing the makespan, that is, the completion time of the last job in the schedule. This notoriously NP-hard problem is highly relevant in practical productions and requires heuristics that provide good solutions quickly in order to deal with large instances. In this paper, we present a heuristic based on the approach of parameterized local search. That is, we aim to replace a given solution by a better solution having distance at most k in a pre-defined distance measure. This is done multiple times in a hill-climbing manner, until a locally optimal solution is reached. We analyze the trade-off between the allowed distance k and the algorithm's running time for four natural distance measures. Example of allowed operations for our considered distance measures are: swapping k pairs of jobs in the sequence, or rearranging k consecutive jobs. For two distance measures, we show that finding an improvement for given k can be done in f(k) · n^𝒪(1) time, while such a running time for the other two distance measures is unlikely. We provide a preliminary experimental evaluation of our local search approaches.

Translated text

Bibtex

AI Read Science

AI Summary

AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.

Example

Background

Key content

Introduction

Methods

Results

Related work

Fund

Key content

Pretraining has recently greatly promoted the development of natural language processing (NLP)
We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance

Try using models to generate summary,it takes about 60s

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper