Maximizing the value of a space mission
type: Item
instance of: scholarly article
title: Maximizing the value of a space mission
zbMATH Open document ID: 0813.90078
DOI: 10.1016/0377-2217(94)90385-9
author: Nicholas G. Hall
author: Michael Magazine
published in: European Journal of Operational Research
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 709907
zbMATH Keywords: value of a space mission
zbMATH Keywords: heuristic
zbMATH Keywords: machine scheduling model
zbMATH Keywords: upper bounding procedures
zbMATH Keywords: preemptive relaxation
zbMATH Keywords: Lagrangean relaxation
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90385-9
OpenAlex ID: W2005186378
cites work: Scheduling jobs with fixed start and end times
cites work: On Transportation Problems with Upper Bounds on Leading Rectangles
cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
cites work: Plus court chemin avec contraintes d'horaires
cites work: Routing with time windows by column generation
cites work: The Factored Transportation Problem
cites work: Q5514188
cites work: The Fixed Job Schedule Problem with Spread-Time Constraints
cites work: The Fixed Job Schedule Problem with Working-Time Constraints
cites work: Q4198056
cites work: Minimal Resources for Fixed and Variable Job Schedules
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Validation of subgradient optimization
cites work: Q4739657
description: scientific article; zbMATH DE number 709907