Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
type: Item
instance of: scholarly article
title: Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
zbMATH Open document ID: 1391.90319
author: Yuri Laio T. V. Silva
author: A. Subramanian
author: Artur Alves Pessoa
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6901535
zbMATH Keywords: order acceptance and scheduling
zbMATH Keywords: arc-time-indexed formulation
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: column generation
zbMATH Keywords: iterated local search
MaRDI profile type: Publication
full work available at URL: j.cor.2017.09.006
OpenAlex ID: W2751180135
cites work: Greedy solutions of selection and ordering problems
cites work: Comparison of bundle and classical column generation
cites work: Job selection in a heavily loaded shop
cites work: Validation of subgradient optimization
cites work: A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
cites work: Q4124332
cites work: Q4124328
cites work: Multi-period job selection: Planning work loads to maximize profit
cites work: Q4452900
cites work: Improved bounds for large scale capacitated arc routing problem
cites work: Variable neighborhood search
cites work: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
cites work: Improved branch-cut-and-price for capacitated vehicle routing
cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
cites work: Order acceptance using genetic algorithms
cites work: An iterated local search heuristic for the split delivery vehicle routing problem
cites work: A simple and effective metaheuristic for the minimum latency problem
cites work: Selecting jobs for heavily loaded shop with lateness penalties
cites work: Order acceptance with weighted tardiness
cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
cites work: Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
cites work: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
cites work: An exact algorithm for single-machine scheduling without machine idle time
cites work: Metaheuristics for a scheduling problem with rejection and tardiness penalties
cites work: Hybrid metaheuristics for the clustered vehicle routing problem
cites work: Order acceptance strategies in a production-to-order environment with setup times and due-dates
cites work: Order acceptance and scheduling with machine availability constraints
DOI: 10.1016/J.COR.2017.09.006
description: scientific article; zbMATH DE number 6901535