Non-permutation flow shop scheduling with order acceptance and weighted tardiness
From MaRDI portal
(Redirected from Publication:670790)
Recommendations
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
Cites work
- A concise survey of scheduling with time-dependent processing times
- A due-date assignment problem with learning effect and deteriorating jobs
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A hybrid policy for order acceptance in batch process industries
- A new constructive heuristic for the flowshop scheduling problem
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Job selection and sequencing on a single machine in a random environment
- Job selection in a heavily loaded shop
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Multi-period job selection: Planning work loads to maximize profit
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- Optimal two- and three-stage production schedules with set-up time included
- Order acceptance using genetic algorithms
- Order acceptance with weighted tardiness
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Permutation vs. non-permutation flow shop schedules
- Preemptive multiprocessor scheduling with rejection
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Selecting jobs for heavily loaded shop with lateness penalties
- Selecting jobs for scheduling on a machine subject to failure
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Towards intelligent manufacturing planning and control systems
- Two-machine flow-shop scheduling with rejection
- Workload based order acceptance in job shop environments
Cited in
(3)
This page was built for publication: Non-permutation flow shop scheduling with order acceptance and weighted tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670790)
