Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
From MaRDI portal
Publication:3902810
hybrid algorithmtraveling salesman problemjob schedulingbranching rulesheuristic approachcomputational experiencerandom test problemsbranch-and-bound algorithmsone-machine sequencingcalculation of optimal strategiessequence dependent setup costslinear delay penaltiescontinuously available machinefathoming criterion
Cited in
(14)- Single machine scheduling with flow time and earliness penalties
- Genetic algorithms for the two-stage bicriteria flowshop problem
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- Implementing and testing the tabu cycle and conditional probability methods
- A tabu search experience in production scheduling
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
- Impact of sequence-dependent setup time on job shop scheduling performance
- Multicriteria scheduling problems: a survey
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
- Scheduling in a sequence dependent setup environment with genetic search
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- Multiple and bicriteria scheduling: A literature survey
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
This page was built for publication: Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902810)
