Two-machine interval shop scheduling with time lags
type: Item
instance of: scholarly article
title: Two-machine interval shop scheduling with time lags
zbMATH Open document ID: 1328.90063
author: Xiandong Zhang
author: Steef van de Velde
published in: Journal of Scheduling
publication date: 2015-11-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6507963
zbMATH Keywords: interval scheduling
zbMATH Keywords: fixed start and end times
zbMATH Keywords: two-machine shop
zbMATH Keywords: dynamic programming
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: s10951-013-0336-y
OpenAlex ID: W1979469095
cites work: Scheduling jobs with fixed start and end times
cites work: Q4829009
cites work: Minimizing the weighted number of tardy jobs on a two-machine flow shop.
cites work: The complexity of theorem-proving procedures
cites work: Q4198056
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
cites work: Interval scheduling: A survey
cites work: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
cites work: Exact and approximation algorithms for the operational fixed interval scheduling problem
cites work: Q4124328
cites work: Sequencing \(n\) jobs on two machines with arbitrary time lags
cites work: Hard tiling problems with simple tiles
cites work: Heuristics for a coupled-operation scheduling problem
cites work: Two-machine open shop scheduling with special transportation times
cites work: On the Flow-Shop Sequencing Problem with No Wait in Process†
cites work: The complexity of satisfiability problems
cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
cites work: Polynomial-time approximation schemes for scheduling problems with time lags
DOI: 10.1007/S10951-013-0336-Y
Recommended article: Schedule execution for two-machine flow-shop with interval processing times
Recommended article: Algorithms and Computation
Recommended article: On-line two-machine job shop scheduling with time lags
Recommended article: TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
Recommended article: On-line two-machine open shop scheduling with time lags
Recommended article: SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
Recommended article: Two-machine shop scheduling with zero and unit processing times
Recommended article: Two-machine flow shop scheduling problems with minimal and maximal delays
Recommended article: The two-machine flowshop scheduling problem with total tardiness
Recommended article: Two-machine flowshop scheduling to minimize total tardiness
description: scientific article; zbMATH DE number 6507963