2013
DOI: 10.5505/pajes.2013.43153
|View full text |Cite
|
Sign up to set email alerts
|

Single Machine Scheduling with General Learning Functions: Optimal Solutions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…The number of flight segments in duty is allowed to be 2, 3, 4 and 5. The cost of each pairing is also calculated according to the equation of (1). The minimum number of crew pairing is found using the first mathematical model.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The number of flight segments in duty is allowed to be 2, 3, 4 and 5. The cost of each pairing is also calculated according to the equation of (1). The minimum number of crew pairing is found using the first mathematical model.…”
Section: Resultsmentioning
confidence: 99%
“…Airline scheduling and planning problems solved sequentially consist of several sub-problems: the flight schedule design, the fleet assignment, the aircraft routing, and the crew scheduling. The main objective of solving these problems is to maximization of airline's profit [1,2]. The airline sector has a narrow profit margin and fierce competition.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation