Non-permutation flow shop scheduling with order acceptance and weighted tardiness
DOI10.1016/J.AMC.2015.08.011zbMATH Open1410.90098OpenAlexW2054000633MaRDI QIDQ670790FDOQ670790
Yingying Yuan, Abdullah Konak, Yi-Yong Xiao, Ren-Qian Zhang
Publication date: 20 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.08.011
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Two-machine flow-shop scheduling with rejection
- Preemptive multiprocessor scheduling with rejection
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
- A hybrid policy for order acceptance in batch process industries
- Scheduling linear deteriorating jobs with rejection on a single machine
- Order acceptance using genetic algorithms
- Multi-period job selection: Planning work loads to maximize profit
- Workload based order acceptance in job shop environments
- Selecting jobs for heavily loaded shop with lateness penalties
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Order acceptance with weighted tardiness
- Job selection in a heavily loaded shop
- A concise survey of scheduling with time-dependent processing times
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Permutation vs. non-permutation flow shop schedules
- A new constructive heuristic for the flowshop scheduling problem
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A due-date assignment problem with learning effect and deteriorating jobs
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Job selection and sequencing on a single machine in a random environment
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Selecting jobs for scheduling on a machine subject to failure
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- Towards intelligent manufacturing planning and control systems
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
Cited In (1)
Uses Software
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)
