A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
From MaRDI portal
Recommendations
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
- scientific article; zbMATH DE number 52239
- scientific article; zbMATH DE number 721865
- scientific article; zbMATH DE number 1094814
- Sequencing heuristic for bicriteria scheduling in a single machine problem
Cites work
- A bicriterion approach to time/cost trade-offs in sequencing
- A dual algorithm for the one-machine scheduling problem
- Job Shop Sequencing Problem on Two Machines with Time Lag Constraints
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Sequencing independent jobs with a single resource
- Solving a bicriterion scheduling problem
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
Cited in
(16)- scientific article; zbMATH DE number 4049369 (Why is no real title available?)
- A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness
- Stochastic bicriteria single machine scheduling with quadratic cost functions
- Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine
- A simulated annealing approach to bicriteria scheduling problems on a single machine
- A Class of Single Machine Central Tendency-Dispersion Bicriteria Problems
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- scientific article; zbMATH DE number 52239 (Why is no real title available?)
- Sequencing heuristic for bicriteria scheduling in a single machine problem
- scientific article; zbMATH DE number 713581 (Why is no real title available?)
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
- A new lower bound approach for single-machine multicriteria scheduling
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
- Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop
- An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
This page was built for publication: A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778533)